#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN=5005,MOD=1e9+7;
ll ksm(ll a,ll b=MOD-2) {
	ll ret=1;
	for(;b;a=a*a%MOD,b>>=1) if(b&1) ret=ret*a%MOD;
	return ret;
}
vector <int> G[MAXN];
int n,fa[MAXN],siz[MAXN],a[MAXN];
ll fac[MAXN],inv[MAXN],ifac[MAXN],g[MAXN],ig[MAXN],f[MAXN][MAXN],ans[MAXN];
ll C(int x,int y) {
	if(x<0||y<0||y>x) return 0;
	return fac[x]*ifac[y]%MOD*ifac[x-y]%MOD;
}
void dfs0(int u) {
	siz[u]=g[u]=ig[u]=1;
	for(int v:G[u]) {
		dfs0(v),siz[u]+=siz[v];
		g[u]=g[u]*g[v]%MOD;
	}
	g[u]=g[u]*inv[siz[u]]%MOD;
	ig[u]=ig[u]*siz[u]%MOD;
}
void dfs1(int u) {
	ans[u]=fac[siz[u]]*g[u]%MOD*f[u][1]%MOD;
	for(int v:G[u]) {
		ll w=fac[siz[u]-siz[v]-1]*g[u]%MOD*ig[v]%MOD*siz[u]%MOD;
		for(int k=2;k<=siz[u];++k) for(int i=max(1,k-siz[u]+siz[v]);i<=siz[v]&&i<k;++i) {
			f[v][i]=(f[v][i]+f[u][k]*w%MOD*C(k-2,i-1)%MOD*C(siz[u]-k,siz[v]-i))%MOD;
		}
		dfs1(v);
	}
}
signed main() {
	scanf("%d",&n);
	for(int i=fac[0]=ifac[0]=1;i<=n;++i) ifac[i]=ksm(fac[i]=fac[i-1]*i%MOD),inv[i]=ksm(i);
	for(int i=2;i<=n;++i) scanf("%d",&fa[i]),G[fa[i]].push_back(i);
	for(int i=1;i<=n;++i) scanf("%d",&a[i]);
	dfs0(1);
	for(int i=1;i<=n;++i) f[1][i]=a[i];
	dfs1(1);
	for(int i=1;i<=n;++i) printf("%lld ",ans[i]); puts("");
	return 0;
}