// Problem: P10013 [集训队互测 2023] Tree Topological Order Counting
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P10013
// Memory Limit: 512 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

const int maxn = 310;
const ll mod = 1000000007;

ll n, a[maxn], fac[maxn], inv[maxn], fa[maxn], ifac[maxn];
vector<int> G[maxn];

inline ll C(ll n, ll m) {
	if (n < m || n < 0 || m < 0) {
		return 0;
	} else {
		return fac[n] * ifac[m] % mod * ifac[n - m] % mod;
	}
}

ll f[maxn], sz[maxn];
int st[maxn], ed[maxn], tim;

void dfs(int u) {
	sz[u] = f[u] = 1;
	st[u] = ++tim;
	for (int v : G[u]) {
		dfs(v);
		f[u] = f[u] * f[v] % mod;
		sz[u] += sz[v];
	}
	f[u] = f[u] * inv[sz[u]] % mod;
	ed[u] = tim;
}

ll g[maxn][maxn];
bool vis[maxn];

void solve() {
	scanf("%lld", &n);
	fac[0] = ifac[0] = 1;
	for (int i = 1; i <= n; ++i) {
		fac[i] = fac[i - 1] * i % mod;
	}
	inv[1] = 1;
	for (int i = 2; i <= n; ++i) {
		inv[i] = (mod - mod / i) * inv[mod % i] % mod;
		scanf("%lld", &fa[i]);
		G[fa[i]].pb(i);
	}
	for (int i = 1; i <= n; ++i) {
		ifac[i] = ifac[i - 1] * inv[i] % mod;
	}
	for (int i = 1; i <= n; ++i) {
		scanf("%lld", &a[i]);
	}
	dfs(1);
	for (int i = 1; i <= n; ++i) {
		mems(g, 0);
		mems(vis, 0);
		g[i][0] = 1;
		int x = i, cnt = 0;
		vis[i] = 1;
		while (x > 1) {
			++cnt;
			int y = fa[x];
			for (int j = 0; j < sz[x]; ++j) {
				for (int k = 1; k <= sz[y] - sz[x]; ++k) {
					g[y][j + k] = (g[y][j + k] + g[x][j] * C(j + k - 1, j) % mod * C(sz[y] - j - k - 1, sz[x] - j - 1)) % mod;
				}
			}
			x = y;
			vis[x] = 1;
		}
		ll coef = fac[n - cnt - sz[i]] * f[i] % mod * fac[sz[i]] % mod, ans = 0;
		for (int j = 1; j <= n; ++j) {
			if (!vis[j] && !(st[i] <= st[j] && st[j] <= ed[i])) {
				coef = coef * inv[sz[j]] % mod;
			}
		}
		for (int j = 0; j < n; ++j) {
			ans = (ans + g[1][j] * a[j + 1]) % mod;
		}
		ans = ans * coef % mod;
		printf("%lld%c", ans, " \n"[i == n]);
	}
}

int main() {
	int T = 1;
	// scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}