#include<bits/stdc++.h>
using namespace std;
int n,x,y,pv[10000003],t,m,fa[10000003],tp,tt,pp;
vector<int>v[10000003];
inline void dfs(int xx){
    if(!pv[fa[xx]]&&pv[xx]) t++;
    for(register int i=0;i<v[xx].size();++i) 
        if(v[xx][i]!=fa[xx]) fa[v[xx][i]]=xx,dfs(v[xx][i]);
    return;
}
inline int read(){
    int xx=0;
    char ch=getchar();
    while(ch<'0'||'9'<ch) ch=getchar();
    while('0'<=ch&&ch<='9') xx=(xx<<1)+(xx<<3)+(ch-'0'),ch=getchar();
    return xx;
}
inline void write(int xx){
    if(xx>=10) write(xx/10);
    putchar((xx%10)+'0');
    return;
}
int main(){
    freopen("birds.in","r",stdin);
    freopen("birds.out","w",stdout);
    n=read();
    for(register int i=1;i<n;++i)
        x=read(),y=read(),v[x].push_back(y),v[y].push_back(x);
    for(register int i=1;i<=n;++i) pv[i]=read();
    dfs(1);
    write(t);
    puts("");
    m=read();
    while(m--){
        x=read();
        if(pv[x]){
            for(register int i=0;i<v[x].size();++i) if(pv[v[x][i]]) ++t;
            --t,pv[x]=0;
        }else{
            for(register int i=0;i<v[x].size();++i) if(pv[v[x][i]]) --t;
            ++t,pv[x]=1;
        }
        write(t);
        puts("");
    }
    return 0;
}