#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
bool be;
constexpr int N = 1e6 + 5, mod = 1e9 + 7;
vector<int>e[N];
int n, a[N], dp[N], tp[N], ans[N];
inline int qpow(int b, int k)
{
	int res = 1;
	while (k) {
		if (k & 1) res = (ll) res * b % mod;
		b = (ll) b * b % mod;
		k >>= 1;
	}
	return res;
}
void dfs1(int u, int f)
{
	int c = e[u].size() - (u != f);
	dp[u] = a[u];
	for (int v : e[u]) {
		if (v != f) {
			dfs1(v, u);
			dp[u] = (dp[u] + (ll) (tp[c] - 1) * qpow((ll) tp[c] * c % mod, mod - 2) % mod * dp[v]) % mod;
		}
	}
}
void hg(int u, int v)
{
	int c = e[u].size();
	dp[u] = (dp[u] - a[u]) % mod;
	dp[u] = (dp[u] - (ll) (tp[c] - 1) * qpow((ll) tp[c] * c % mod, mod - 2) * dp[v]) % mod;
	dp[u] = (ll) dp[u] * 2 % mod * (tp[c - 1] - 1) % mod * c % mod * qpow((ll) (tp[c] - 1) * (c - 1) % mod, mod - 2) % mod;
	dp[u] = (dp[u] + a[u]) % mod;
	c = e[v].size();
	dp[v] = (dp[v] - a[v]) % mod;
	dp[v] = (ll) dp[v] * (tp[c] - 1) % mod * (c - 1) % mod * qpow(2ll * (tp[c - 1] - 1) % mod * c % mod, mod - 2) % mod;
	dp[v] = (dp[v] + (ll) (tp[c] - 1) * qpow((ll) tp[c] * c % mod, mod - 2) % mod * dp[u]) % mod;
	dp[v] = (dp[v] + a[v]) % mod;
}
void dfs2(int u, int f)
{
	ans[u] = (dp[u] + mod) % mod;
	for (int v : e[u]) {
		if (v != f) {
			hg(u, v);
			dfs2(v, u);
			hg(v, u);
		}
	}
}
bool en;
int main()
{
	cerr << (&be - &en) / 1024.0 / 1024 << " MB\n--------------------------------" << endl;
#ifdef IAKIOI
	freopen("in.in", "r", stdin);
//	freopen("out.out", "w", stdout);
#endif
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n;
	for (int i = 2; i <= n; ++i) {
		int f;
		cin >> f;
		e[f].emplace_back(i);
		e[i].emplace_back(f);
	}
	for (int i = 1; i <= n; ++i) cin >> a[i];
	tp[0] = 1;
	for (int i = 1; i <= n; ++i) {
		tp[i] = tp[i - 1] * 2ll % mod;
	}
	dfs1(1, 1);
	dfs2(1, 1);
	for (int i = 1; i <= n; ++i) cout << ans[i] << '\n';
	return 0;
}