#include <bits/stdc++.h>
using namespace std;
const int N = 5005;
const int mod = 1e9 + 7;

inline int add(int x, int y) {x += y; return x >= mod ? x - mod : x;}
inline int del(int x, int y) {x -= y; return x < 0 ? x + mod : x;}
inline void Add(int &x, int y) {x = add(x, y);}
inline void Del(int &x, int y) {x = del(x, y);}

int n, fa[N], sz[N], dp[N][N], fac[N], inv[N], depth[N], INV[N], val[N], a[N], iva[N];

inline int C(int x, int y) {return (x < 0 || y < 0 || x < y) ? 0 : 1ll * fac[x] * inv[y] % mod * inv[x - y] % mod;}
inline int iC(int x, int y) {return 1ll * inv[x] * fac[y] % mod * fac[x - y] % mod;}
inline int qpow(int x, int y) {
    int res = 1;
    while (y) {
        if (y & 1) res = 1ll * res * x % mod;
        x = 1ll * x * x % mod;
        y >>= 1;
    }
    return res;
}

int main() {
    scanf("%d", &n); depth[1] = 1;
    fac[0] = 1;
    for (int i = 1; i <= n; ++i) fac[i] = 1ll * fac[i - 1] * i % mod;
    inv[n] = qpow(fac[n], mod - 2);
    for (int i = n; i >= 1; --i) inv[i - 1] = 1ll * inv[i] * i % mod;
    INV[1] = 1;
    for (int i = 2; i <= n; ++i) INV[i] = 1ll * (mod - mod / i) * INV[mod % i] % mod;
    for (int i = 1; i <= n; ++i) val[i] = 1;
    for (int i = 2; i <= n; ++i) scanf("%d", &fa[i]), depth[i] = depth[fa[i]] + 1;
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    for (int i = n; i >= 1; --i) {
        sz[i]++; val[i] = 1ll * val[i] * INV[sz[i]] % mod;
        iva[i] = qpow(val[i], mod - 2);
        sz[fa[i]] += sz[i];
        val[fa[i]] = 1ll * val[fa[i]] * val[i] % mod;
        val[i] = 1ll * val[i] * fac[sz[i]] % mod;
    }
    dp[1][1] = fac[n];
    for (int i = 1; i <= n; ++i) dp[1][1] = 1ll * dp[1][1] * INV[sz[i]] % mod;
    for (int i = 2; i <= n; ++i)
        for (int j = depth[i]; j <= n; ++j) {
            for (int k = depth[i] - 1; k < j; ++k) {
                if (dp[fa[i]][k] == 0) continue;
                int res = dp[fa[i]][k];
                res = 1ll * res * C(n - j, sz[i] - 1) % mod * val[i] % mod;
                res = 1ll * res * iC(n - k, sz[fa[i]] - 1) % mod * inv[sz[fa[i]]] % mod * sz[fa[i]] % mod * iva[i] % mod;
                res = 1ll * res * fac[sz[fa[i]] - sz[i]] % mod * INV[sz[fa[i]] - sz[i]] % mod;
                res = 1ll * res * C(n - k - sz[i], sz[fa[i]] - sz[i] - 1);
                Add(dp[i][j], res);
            }
        }
    for (int i = 1, res; i <= n; ++i) {
        res = 0;
        for (int j = 1; j <= n; ++j) Add(res, 1ll * dp[i][j] * a[j] % mod);
        printf("%d%c", res, i == n ? '\n' : ' ');
    }
    return 0;
}