#include<bits/stdc++.h>

#define ll long long
#define mk make_pair
#define fi first
#define se second

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=1e9+7;
int ksm(int x,ll y,int p=mod){
	int ans=1;y%=(p-1);
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}
int cmod(int x){if(x>=mod)x-=mod;return x;}

template<typename T>void cmax(T &x,T v){x=max(x,v);}
template<typename T>void cmin(T &x,T v){x=min(x,v);}

const int N=5005;
int n,b[N],fa[N],f[N][N],g[N][N],tp[N],sz[N],tmp[N];
int fac[N],ifac[N],Inv[N];
vector<int>G[N];

void dp1(int u){
	g[u][0]=1,sz[u]=0,tp[u]=1;
	for(int v:G[u])dp1(v);

	// cout<<"dp1 u = "<<u<<endl;
	for(int v:G[u]){
		fill(tmp,tmp+sz[u]+sz[v]+1,0);
		for(int i=0;i<=sz[u];i++)if(g[u][i]){
			for(int j=0;j<=sz[v];j++)if(g[v][j])add(tmp[i+j],1ll*g[u][i]*g[v][j]%mod);
		}
		sz[u]+=sz[v];
		tp[u]=1ll*tp[u]*tp[v]%mod;
		// cout<<" + v = "<<v<<" -> tmp = ";
		// for(int j=0;j<=sz[u];j++)cout<<1ll*tmp[j]*fac[j]%mod<<" ";puts("");
		memcpy(g[u],tmp,sizeof(int)*(sz[u]+1));
		// cout<<" + v = "<<v<<" -> g = ";
		// for(int j=0;j<=sz[u];j++)cout<<1ll*g[u][j]*fac[j]%mod<<" ";puts("");
	}
	for(int j=sz[u]+1;j>=1;j--)g[u][j]=1ll*g[u][j-1]*Inv[j]%mod;
	sz[u]++,tp[u]=1ll*tp[u]*Inv[sz[u]]%mod,g[u][0]=1ll*g[u][0]*Inv[sz[u]]%mod;

	// cout<<"g "<<u<<" = " ;
	// for(int j=0;j<=sz[u];j++)cout<<1ll*g[u][j]*fac[j]%mod<<" ";puts("");
}

int ans[N];
void dp2(int u){
	ans[u]=1ll*f[u][0]*g[u][0]%mod*sz[u]%mod;
	for(int j=0;j<=sz[u]-1;j++)g[u][j]=1ll*g[u][j+1]*(j+1)%mod;
	// cout<<"dp2 u = "<<u<<endl;
	// cout<<" now f = ";
	// for(int i=0;i<=sz[u]-1;i++)cout<<f[u][i]<<" ";puts("");
	// cout<<" now g = ";
	// for(int i=0;i<=sz[u]-1;i++)cout<<g[u][i]<<" ";puts("");
	for(int v:G[u]){
		// cout<<" trans "<<u<<" -> "<<v<<endl;
		vector<int>h(sz[u]-sz[v]);
		int iv=inv(g[v][0]);
		for(int i=0;i<=sz[u]-1-sz[v];i++){
			h[i]=g[u][i];
			for(int j=0;j<i;j++)add(h[i],mod-1ll*h[j]*g[v][i-j]%mod);
			h[i]=1ll*h[i]*iv%mod;
		}
		// cout<<" h = ";for(int i=0;i<=sz[u]-1-sz[v];i++)cout<<h[i]<<" ";puts("");
		for(int i=1;i<=sz[u]-1;i++)if(f[u][i]){
			f[u][i]=1ll*f[u][i]*Inv[i]%mod;
			for(int j=max(0,i-sz[v]);j<=min(sz[u]-sz[v]-1,i-1);j++){
				add(f[v][i-j-1],1ll*f[u][i]*h[j]%mod);
			}
			f[u][i]=1ll*f[u][i]*i%mod;
		}

		dp2(v);
	}
}

signed main(void){

#ifndef ONLINE_JUDGE
	freopen("in.txt","r",stdin);
#endif

	n=read();
	for(int i=2;i<=n;i++)fa[i]=read(),G[fa[i]].emplace_back(i);
	for(int i=1;i<=n;i++)b[i]=read();

	fac[0]=1;for(int i=1;i<=n;i++)fac[i]=1ll*fac[i-1]*i%mod;
	for(int i=1;i<=n;i++)ifac[i]=inv(fac[i]),Inv[i]=inv(i);

	dp1(1);
	for(int j=0;j<=n-1;j++)f[1][j]=1ll*fac[j]*b[j+1]%mod*fac[n-j-1]%mod;
	dp2(1);
	for(int i=1;i<=n;i++)cout<<ans[i]<<" \n"[i==n];

	return 0;
}