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

#define int long long

template <int MOD=1000000007>
struct Modular {
  int value;
  static const int MOD_value = MOD;

  Modular(long long v = 0) { value = v % MOD; if (value < 0) value += MOD;}
  Modular(long long a, long long b) : value(0){ *this += a; *this /= b;}

  Modular& operator+=(Modular const& b) {value += b.value; if (value >= MOD) value -= MOD; return *this;}
  Modular& operator-=(Modular const& b) {value -= b.value; if (value < 0) value += MOD;return *this;}
  Modular& operator*=(Modular const& b) {value = (long long)value * b.value % MOD;return *this;}

  friend Modular mexp(Modular a, long long e) {
    Modular res = 1; while (e) { if (e&1) res *= a; a *= a; e >>= 1; }
    return res;
  }
  friend Modular inverse(Modular a) { return mexp(a, MOD - 2); }

  Modular& operator/=(Modular const& b) { return *this *= inverse(b); }
  friend Modular operator+(Modular a, Modular const b) { return a += b; }
  friend Modular operator-(Modular a, Modular const b) { return a -= b; }
  friend Modular operator-(Modular const a) { return 0 - a; }
  friend Modular operator*(Modular a, Modular const b) { return a *= b; }
  friend Modular operator/(Modular a, Modular const b) { return a /= b; }
  friend std::ostream& operator<<(std::ostream& os, Modular const& a) {return os << a.value;}
  friend bool operator==(Modular const& a, Modular const& b) {return a.value == b.value;}
  friend bool operator!=(Modular const& a, Modular const& b) {return a.value != b.value;}
};


int32_t main(){
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	int n;
	cin >> n;
	vector<vector<int>> adj(n+1);
	for(int i=1;i<n;i++){
		int p;
		cin >> p;
		adj[i+1].emplace_back(p);
		adj[p].emplace_back(i+1);
	}
	vector<Modular<>> v(n+1);
	for(int i=1;i<=n;i++){
		int a;cin>>a;
		v[i]=a;
	}
	vector<Modular<>> Expr(n+1);
	{
		Modular<> power = 1;
		for(int i=1;i<=n;i++){
			Expr[i]=(power-1)/(power*(i-1));
			power*=2;
		}
	}
	vector<Modular<>> Scores(n+1);
	function<void(int,int)> dfs = [&](int x,int p){
		Scores[x] = v[x];
		for(int&j:adj[x])if(j!=p){
			dfs(j,x);
			Scores[x] += Scores[j]*Expr[adj[x].size()];
		}
	};
	dfs(1,0);
	vector<Modular<>> ans(n+1);
	function<void(int,int,Modular<>)> dfs2 = [&](int x,int p,Modular<> s){
		ans[x]=v[x]+s*Expr[adj[x].size()+1];
		for(int&j:adj[x])if(j!=p){
			ans[x]+=Scores[j]*Expr[adj[x].size()+1];
		};
		for(int&j:adj[x])if(j!=p){
			dfs2(j,x,ans[x]-Scores[j]*Expr[adj[x].size()+1]);
		};
	};
	dfs2(1,0,0);
	for(int i=1;i<=n;i++)cout<<ans[i]<<'\n';
}