#include<bits/stdc++.h>

#define vc vector
#define pb emplace_back
#define pii pair<int, int>
#define mkp make_pair
#define rep(i, a, b) for(int i = (a); i <= (b); ++i)
#define lep(i, a, b) for(int i = (a); i >= (b); --i)

using namespace std;

inline int read() {
	int x = 0, w = 0; char ch = getchar(); while(!isdigit(ch)) w |= (ch == '-'), ch = getchar();
	while(isdigit(ch)) x = x * 10 + (ch ^ 48), ch = getchar(); return w ? -x : x; 
}

const int N = 5005, P = 1e9 + 7;

int fc[N], ifc[N];
inline void inc(int &x, int y) { x += y - P; x += (x >> 31) & P; }
inline int power(int a, int b) { int res = 1; for(; b; b >>= 1, a = 1ll * a * a % P) if(b & 1) res = 1ll * res * a % P; return res; }
inline void fac_init(int n) {
	fc[0] = ifc[0] = 1;
	rep(i, 1, n) fc[i] = 1ll * i * fc[i - 1] % P;
	rep(i, 1, n) ifc[i] = power(fc[i], P - 2);
}

int n, b[N], fa[N], sz[N], g[N], ans[N], f[N], s[N];
vc<int> G[N];

inline void dfs1(int x) {
	sz[x] = g[x] = 1;
	for(auto y: G[x]) {
		dfs1(y); sz[x] += sz[y];
		g[x] = 1ll * g[x] * g[y] % P;
	}
	g[x] = 1ll * g[x] * ifc[sz[x]] % P;
}

inline void presum() { rep(i, 1, n) inc(s[i] = s[i - 1], f[i - 1]); }

inline void dfs2(int x) {
	presum(); 
	int val = 1ll * g[x] * fc[sz[x]] % P;
	rep(i, 1, n) if(n - i >= sz[i] - 1) 
		inc(ans[x], 1ll * s[i] * b[i] % P * val % P * fc[n - i] % P * ifc[n - i - sz[x] + 1] % P);
	
	vc<int> dp(n + 1, 0);
	for(auto y: G[x]) {
		val = 1ll * g[x] * fc[sz[x]] % P * power(g[y], P - 2) % P;
		rep(i, 0, n) dp[i] = f[i]; 
		presum();
		rep(i, 0, n) 
			if(n - i >= sz[x] - 1) 
				f[i] = 1ll * s[i] * val % P * fc[n - i - sz[y]] % P * ifc[n - i - sz[x] + 1] % P;
			else f[i] = 0;
		dfs2(y);
		rep(i, 0, n) f[i] = dp[i], dp[i] = 0;
	}
}

signed main() {
	n = read();
	fac_init(n);
	rep(i, 2, n) fa[i] = read(), G[fa[i]].pb(i);
	rep(i, 1, n) b[i] = read();

	dfs1(1);
	f[0] = 1;
	dfs2(1);
	
	rep(i, 1, n) printf("%d ", ans[i]); putchar(10);
	return 0;
}