// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define mod 1000000007
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 5005
#define inf 0x3f3f3f3f

#define poly vector<modint>
poly operator *(poly a,poly b){
	if(!a.size()||!b.size())return {};
	poly c(a.size()+b.size()-1,0);
	for(int i=0;i<a.size();++i)for(int j=0;j<b.size();++j)c[i+j]+=a[i]*b[j]*C(i+j,j);
	return c;
}

int n,fa[maxn];
vi e[maxn];
modint w[maxn];

int sz[maxn];
poly f[maxn],g[maxn];
void dfs1(int u){
	sz[u]=0;
	f[u]={1};
	for(int v:e[u]){
		dfs1(v);
		f[u]=f[u]*f[v];
		sz[u]+=sz[v];
	}
	f[u].pb(0);
	f[u][sz[u]+1]+=f[u][sz[u]];
	sz[u]++;
	For(j,0,sz[u]-1) f[u][j]*=iv[sz[u]-j];
}

poly pre[maxn],suf[maxn];
void dfs2(int u){
	int ss=e[u].size();
	pre[0]=g[u];
	For(i,1,ss) pre[i]=pre[i-1]*f[e[u][i-1]];
	suf[ss]={1};
	Rep(i,ss-1,0) suf[i]=suf[i+1]*f[e[u][i]];
	For(i,0,ss-1){
		int v=e[u][i];
		g[v]=pre[i]*suf[i+1];
	}
	For(i,0,ss-1) dfs2(e[u][i]);
}

signed main()
{
	n=read(); initC(n+1);
	For(i,2,n)fa[i]=read(),e[fa[i]].pb(i);
	For(i,1,n)w[i]=read();
	reverse(w+1,w+n+1);
	dfs1(1);
	For(u,1,n){
		poly now;
		now.resize(sz[u]);
		now[sz[u]-1]=f[u][sz[u]-1];
		for(int x=fa[u],lst=u;x;lst=x,x=fa[x]){
			for(int v:e[x])
				if(v!=lst) now=now*f[v];
			For(j,0,(int)now.size()-1){
				int ups=sz[x]-j-1;
				now[j]*=iv[ups];
			}
		}
		modint res=0;
	//	for(auto x:now)cout<<x.x<<" ";cout<<"\n";
		For(j,0,(int)now.size()-1){
			modint tmp=now[j]*w[j+1]*fac[n-j-1];
	//		cout<<tmp.x<<" ";cout<<"\n";
			res+=tmp;
		}
	//	cout<<"i: "<<u<<" "<<res.x<<"\n";
		cout<<res.x<<" ";
	}
	return 0;
}