#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using i128 = __int128;
using u128 = unsigned __int128;
template <typename T>
void chkmax(T &x, const T &y) {
  if (x < y) x = y;
}
template <typename T>
void chkmin(T &x, const T &y) {
  if (y < x) x = y;
}
constexpr int MAXN = 5010, MOD = 1e9 + 7;
void inc(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
int qpow(int x, int y) {
  int ret = 1;
  for (; y; y >>= 1, x = (ll)x * x % MOD)
    if (y & 1) ret = (ll)ret * x % MOD;
  return ret;
}
int n, fa[MAXN], sz[MAXN], wys[MAXN], iwys[MAXN], inv[MAXN], dp[MAXN][MAXN];
int fac[MAXN], ifac[MAXN], ans[MAXN], b[MAXN];
vector<int> g[MAXN];
int C(int x, int y) { return (ll)fac[x] * ifac[y] % MOD * ifac[x - y] % MOD; }
void dfs(int u, int lb) {
  int rb = n - sz[u] + 1;
  for (int i = lb + 1; i <= rb; ++i) inc(dp[u][i], dp[u][i - 1]);
  int coef = (ll)wys[u] * sz[u] % MOD * fac[sz[u] - 1] % MOD;
  for (int i = lb; i <= rb; ++i) {
    ans[u] = (ans[u] + (ll)dp[u][i] * C(rb - i + sz[u] - 1, rb - i) % MOD *
                           coef * b[i]) %
             MOD;
  }
  for (auto v : g[u]) {
    coef = (ll)wys[u] * iwys[v] % MOD * sz[u] % MOD * fac[sz[u] - sz[v] - 1] % MOD;
    for (int x = lb; x <= rb; ++x) {
      dp[v][x + 1] = (ll)dp[u][x] * C(rb - x + sz[u] - sz[v] - 1, rb - x) %
                     MOD * coef % MOD;
    }
    dfs(v, lb + 1);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 2; i <= n; ++i) {
    cin >> fa[i];
    g[fa[i]].emplace_back(i);
  }
  for (int i = 1; i <= n; ++i) cin >> b[i];
  fill(sz + 1, sz + n + 1, 1);
  for (int i = n; i >= 2; --i) sz[fa[i]] += sz[i];
  fac[0] = 1;
  for (int i = 1; i <= n; ++i) fac[i] = (ll)fac[i - 1] * i % MOD;
  ifac[n] = qpow(fac[n], MOD - 2);
  for (int i = n - 1; i >= 0; --i) ifac[i] = (ll)ifac[i + 1] * (i + 1) % MOD;
  for (int i = 1; i <= n; ++i) inv[i] = (ll)ifac[i] * fac[i - 1] % MOD;
  for (int i = 1; i <= n; ++i) {
    wys[i] = inv[sz[i]];
    iwys[i] = sz[i];
  }
  for (int i = n; i >= 2; --i) {
    wys[fa[i]] = (ll)wys[fa[i]] * wys[i] % MOD;
    iwys[fa[i]] = (ll)iwys[fa[i]] * iwys[i] % MOD;
  }
  dp[1][1] = 1;
  dfs(1, 1);
  for (int i = 1; i <= n; ++i) cout << ans[i] << " \n"[i == n];
  return 0;
}
/*
g++ C.cpp -o C -std=c++14 -O2 -Wall -Wextra -Wshadow -g
-fsanitize=address,undefined
*/