#include<bits/stdc++.h>
using namespace std;
const int N=5005,mod=1e9+7;
long long dp[N][N],wl[N];
long long fac[N],inv[N];
int n,sz[N];vector<int> to[N];

long long c(int x,int y){
	return fac[x]*inv[y]%mod*inv[x-y]%mod; 
}

long long iv(long long a){
	long long b=mod-2,c=1;
	while(b){
		if(b&1)c=c*a%mod;a=a*a%mod;b>>=1; 
	}return c;
}

void init(int x){
	wl[x]=sz[x]=1;
	for(auto j:to[x])
		init(j),wl[x]=wl[x]*wl[j]%mod*iv(sz[j])%mod,sz[x]+=sz[j];
	wl[x]=wl[x]*fac[sz[x]-1]%mod;
}

void solve(int x){//cout<<x<<"\n";
	long long wx;
	for(auto i:to[x]){
		wx=wl[x]*iv(c(sz[x]-1,sz[i]))%mod*iv(wl[i])%mod;
		for(int j=1;j<=sz[x]-sz[i];j++)
			for(int k=0;k<sz[i];k++)
				dp[i][k]=(dp[i][k]+wx*dp[x][j+k]%mod*c(j+k-1,k)%mod*c(sz[x]-j-k-1,sz[i]-k-1)%mod)%mod;
		solve(i);
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0); cin>>n; int x;
	fac[0]=1;for(int i=1;i<=n;i++)fac[i]=fac[i-1]*i%mod;
	inv[n]=iv(fac[n]);for(int i=n-1;i>=0;i--)inv[i]=inv[i+1]*(i+1)%mod;
	for(int i=2;i<=n;i++)cin>>x,to[x].push_back(i);
	for(int i=1;i<=n;i++)cin>>dp[1][i-1];
	init(1);solve(1);long long ans=0;
	for(int i=1;i<=n;i++)cout<<dp[i][0]*wl[i]%mod<<" ";
}