#ifdef t9unkubj
#pragma GCC optimize("O3")
//#include"template.h"
#include"template_no_debug.h"
#else
#undef _GLIBCXX_DEBUG
#pragma GCC optimize("O3")
#define dbg(...) 199958
using namespace std;
#include<bits/stdc++.h>
using uint=unsigned;
using ll=long long;
using ull=unsigned long long;
using ld=long double;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T>using vc=vector<T>;
template<class T>using vvc=vc<vc<T>>;
template<class T>using vvvc=vvc<vc<T>>;
using vi=vc<int>;
using vvi=vc<vi>;
using vvvi=vc<vvi>;
using vl=vc<ll>;
using vvl=vc<vl>;
using vvvl=vc<vvl>;
template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>;
template<class T>using bipq=priority_queue<T>;
#define rep(i,n) for(ll (i)=0;i<(ll)(n);i++)
#define REP(i,j,n) for(ll (i)=(j);i<(ll)(n);i++)
#define DREP(i,n,m) for(ll (i)=(n);i>=(m);i--)
#define drep(i,n) for(ll i=((n)-1);i>=0;i--)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define is insert
#define bg begin()
#define ed end()
void scan(int&a) { cin >> a; }
void scan(ll&a) { cin >> a; }
void scan(string&a) { cin >> a; }
void scan(char&a) { cin >> a; }
void scan(uint&a) { cin >> a; }
void scan(ull&a) { cin >> a; }
void scan(bool&a) { cin >> a; }
void scan(ld&a){ cin>> a;}
template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); }
void read() {}
template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); }
#define INT(...) int __VA_ARGS__; read(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; read(__VA_ARGS__);
#define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__);
#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);
#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__);
#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__);
#define LD(...) ld __VA_ARGS__; read(__VA_ARGS__);
#define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name);
#define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name);
void print(int a) { cout << a; }
void print(ll a) { cout << a; }
void print(string a) { cout << a; }
void print(char a) { cout << a; }
void print(uint a) { cout << a; }
void print(bool a) { cout << a; }
void print(ull a) { cout << a; }
void print(ld a){ cout<< a; }
template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;}
void PRT() { cout <<endl; return ; }
template<class T> void PRT(T a) { print(a); cout <<endl; return; }
template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; }
template<class T,class F>
bool chmin(T &x, F y){
    if(x>y){
        x=y;
        return true;
    }
    return false;
}
template<class T, class F>
bool chmax(T &x, F y){
    if(x<y){
        x=y;
        return true;
    }
    return false;
}
void YesNo(bool b){
    cout<<(b?"Yes":"No")<<endl;
}
void Yes(){
    cout<<"Yes"<<endl;
}
void No(){
    cout<<"No"<<endl;
}
template<class T>
int popcount(T n){
    return __builtin_popcount(n);
}
template<class T>
T sum(vc<T>&a){
    return accumulate(all(a),T(0));
}
template<class T>
T max(vc<T>&a){
    return *max_element(all(a));
}
template<class T>
T min(vc<T>&a){
    return *min_element(all(a));
}
template<class T>
void unique(vc<T>&a){
    a.erase(unique(all(a)),a.end());
}
vvi readgraph(int n,int m,int off = -1){
    vvi g(n);
    rep(i, m){
        int u,v;
        cin>>u>>v;
        u+=off,v+=off;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    return g;
}
vvi readtree(int n,int off=-1){
    return readgraph(n,n-1,off);
}
template<class T>
vc<T> presum(vc<T> &a){
    vc<T> ret(a.size()+1);
    rep(i,a.size())ret[i+1]=ret[i]+a[i];
    return ret;
}
template<class T, class F>
vc<T> &operator+=(vc<T> &a,F b){
    for (auto&v:a)v += b;
    return a;
}
template<class T, class F>
vc<T> &operator-=(vc<T>&a,F b){
    for (auto&v:a)v-=b;
    return a;
}
template<class T, class F>
vc<T> &operator*=(vc<T>&a,F b){
    for (auto&v:a)v*=b;
    return a;
}
#endif
double pass_time=0;
template<size_t dmax>
struct bfs_euler_tour{
    vector<vector<int>>g;
    vector<int>ord;
    vector<int>par;
    vector<array<pair<int,int>,dmax+1>>segment;
    bfs_euler_tour(vector<vector<int>>g):g(g),ord(g.size(),-1),par(g.size(),-1),segment(g.size()){
        queue<int>que;
        que.push(0);
        int t=0;
        while(que.size()){
            auto p=que.front();que.pop();
            ord[p]=t++;
            for(auto x:g[p]){
                if(ord[x]==-1){
                    par[x]=p;
                    que.push(x);
                } 
            }
        }
        for(int i=0;i<int(g.size());i++)segment[i][0]=make_pair(ord[i],ord[i]+1);
        for(int i=1;i<=dmax;i++){
            for(int j=0;j<int(g.size());j++){
                segment[j][i]=make_pair(int(1e9),-1);
                for(auto x:g[j]){
                    if(x==par[j])continue;
                    segment[j][i].first=min(segment[j][i].first,segment[x][i-1].first);
                    segment[j][i].second=max(segment[j][i].second,segment[x][i-1].second);
                }
            }
        }
    }
    vector<pair<int,int>>merge_segments(vector<pair<int,int>>&segments){
            sort(segments.begin(),segments.end(),[](auto a,auto b){
                return a.second<b.second;
            });
            segments.erase(unique(segments.begin(),segments.end()),segments.end());
            vector<pair<int,int>>res;
            pair<int,int>now{1e9,-1};//[a,b)
            for(auto [a,b]:segments){
                if(now.second>=a){//[a,b) [c,d) 
                    now.first=min(now.first,a);
                    now.second=max(now.second,b);
                }else{
                    if(now!=make_pair(int(1e9),-1))res.emplace_back(now);
                    now=make_pair(a,b);
                }
            }
            res.emplace_back(now);
            return res;
    }
    inline pair<int,int>vertex(int u,int d){//下にuからの距離がdである頂点集合を返す(半開)
        if(u==-1)return make_pair(0,1);
        if(segment[u][d].first==1e9)return make_pair(0,0);
        return segment[u][d];
    }
    //上に距離がd,上に距離がd-1,..下に距離がdの順に返す(半開)
    vector<pair<int,int>>query(int u,int d){
        assert(d<=dmax);
        vector<pair<int,int>>res;
        res.emplace_back(make_pair(ord[u],ord[u]+1));
        auto u_=u;
        for(int d_=1;d_<=d;d_++){
            if(u_!=-1)u_=par[u_];
            res.emplace_back(vertex(u_,d-d_));
            res.emplace_back(vertex(u_,0));
        }
        reverse(res.begin(),res.end());
        for(int d_=1;d_<=d;d_++){
            res.emplace_back(vertex(u,d_));
        }
        return merge_segments(res);
    }
};
#include<atcoder/lazysegtree>
ll op(ll a,ll b){return a+b;}
ll e(){return 0ll;}
ll op2(int a,ll b){if(a)return 0ll;return b;}
int op3(int a,int b){return a|b;}
int e2(){return 0;}
void solve(){
    INT(n);
    auto g=readtree(n,0);
    VC(int,a,n);
    bfs_euler_tour<2> t(g);
    atcoder::lazy_segtree<ll,op,e,int,op2,op3,e2>seg(n);
    rep(i,n)seg.set(t.ord[i],a[i]);
    INT(q);
    while(q--){
        INT(x);
        ll sum=0;
        auto res=t.query(x,2);
        for(auto [a,b]:res){
            sum+=seg.prod(a,b);
            seg.apply(a,b,1);
        }
        seg.set(t.ord[x],sum);
        PRT(sum);
    }
}
signed main(){
    #ifdef t9unkubj
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    cin.tie(0)->sync_with_stdio(0);
    pass_time=clock();
    int t=1;
    while(t--)solve();
    pass_time=clock()-pass_time;
    dbg(pass_time/CLOCKS_PER_SEC);
}