#include <bits/stdc++.h>
#define LL long long
using namespace std;

int read() {
	int s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

const int MAXN = 5005, mod = 1000000007;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = (LL)res * a % mod;
		a = (LL)a * a % mod, b >>= 1;
	}
	return res;
}

#define Fplus(x, y) (x + y < mod ? x += y : x += y - mod)
#define Fminus(x, y) (x >= y ? x -= y : x += mod - y)

int fac[MAXN], inv[MAXN];

void init(int n = 5000) {
	fac[0] = 1;
	for (int i = 1; i <= n; i++)
		fac[i] = (LL)fac[i - 1] * i % mod;
	inv[n] = qpow(fac[n], mod - 2);
	for (int i = n; i; i--)
		inv[i - 1] = (LL)inv[i] * i % mod;
}

int C(int n, int m) {
	return n < m ? 0 : (LL)fac[n] * inv[m] % mod * inv[n - m] % mod;
}

int n, b[MAXN];
vector<int> e[MAXN];
int fa[MAXN], sz[MAXN];
int g[MAXN][MAXN] = {{0}}, f[MAXN] = {0};
int pre[MAXN] = {0};

signed main() {
	n = read();
	for (int i = 2; i <= n; i++)
		e[fa[i] = read()].push_back(i);
	for (int i = 1; i <= n; i++)
		b[i] = read();
	init();
	for (int i = n; i; i--) {
		sz[i] = 1, f[i] = 1;
		for (int j : e[i])
			sz[i] += sz[j], f[i] = (LL)f[i] * f[j] % mod;
		f[i] = (LL)f[i] * qpow(sz[i], mod - 2);
	}
	g[1][1] = 1;
	for (int i = 2; i <= n; i++) {
		int cnt = sz[fa[i]] - sz[i] - 1, coef = fac[cnt];
		for (int j : e[fa[i]])
			if (i != j)
				coef = (LL)coef * f[j] % mod;
		for (int j = 1; j <= n - sz[i]; j++)
			pre[j] = (pre[j - 1] + (LL)C(n - j - sz[i], cnt) * coef % mod * g[fa[i]][j] % mod) % mod;
		for (int j = 1; j <= n - sz[i] + 1; j++)
			g[i][j] = pre[j - 1];
	}
	for (int i = 1; i <= n; i++) {
		int coef = fac[sz[i] - 1];
		for (int j : e[i])
			coef = (LL)coef * f[j] % mod;
		// cout << coef << endl;
		int ans = 0;
		for (int j = 1; j <= n; j++)
			ans = (ans + (LL)coef * C(n - j, sz[i] - 1) % mod * g[i][j] % mod * b[j] % mod) % mod;
		printf("%d ", ans);
	}
	return 0;
}