#include<iostream>
#include<cstdio>
#include<vector>
#define N 5000
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
int n,fa[N+1],sz[N+1],C[N+1][N+1],dp[N+1][N+1],DP[N+1],ans[N+1],F[N+1];
vector<int>E[N+1];
void dfs(int x)
{
	DP[x]=1;
	for (int i=0;i<E[x].size();++i) dfs(E[x][i]),DP[x]=1ll*DP[x]*DP[E[x][i]]%mod*C[sz[x]+sz[E[x][i]]][sz[x]]%mod,sz[x]+=sz[E[x][i]];
	sz[x]++;
	return;
}
void dfs2(int x)
{
	int smz=sz[x]-1;
	ans[x]=dp[x][1];
	for (int i=1;i<=smz;++i) dp[x][i]=dp[x][i+1];
	for (int i=0;i<E[x].size();++i)
	{
		smz-=sz[E[x][i]];
		for (int j=1;j<=smz;++j) F[j]=0;
		for (int j=1;j<=smz;++j)
			for (int k=0;k<=sz[E[x][i]];++k)
				Adder(F[j],1ll*C[j-1+k][j-1]*C[smz-j+sz[E[x][i]]-k][sz[E[x][i]]-k]%mod*dp[x][j+k]%mod);
		for (int j=1;j<=sz[E[x][i]];++j)
			for (int k=0;k<=smz;++k)
				Adder(dp[E[x][i]][j],1ll*C[j-1+k][j-1]*C[sz[E[x][i]]-j+smz-k][smz-k]%mod*dp[x][j+k]%mod);
		for (int j=1;j<=smz;++j) dp[x][j]=F[j];
		dfs2(E[x][i]);
	}
	return;
}
int main()
{
	int x;
	for (int i=0;i<=N;++i) C[i][0]=1;
	for (int i=1;i<=N;++i)
		for (int j=1;j<=i;++j)
			C[i][j]=MD(C[i-1][j-1]+C[i-1][j]);
	n=read();
	for (int i=2;i<=n;++i) x=read(),E[x].push_back(i);
	for (int i=1;i<=n;++i) dp[1][i]=read();
	dfs(1),dfs2(1);
	for (int i=1;i<=n;++i) printf("%lld ",1ll*ans[i]*DP[i]%mod);
	puts("");
	return 0;
}