[SHOI2014]三叉神经树

#include<iostream>
#include<cstdio>
#define ll long long
#define N 500005

int f[3 * N],c[3 * N][2],v[3 * N],m1[3 * N],m2[3 * N],ans[3 * N],t[3 * N];

#define l(x) c[x][0]
#define r(x) c[x][1]

inline bool nroot(int x){return l(f[x]) == x || r(f[x]) == x;}

inline void up (int x){
	m1[x] = m1[r(x)];
	m2[x] = m2[r(x)];
	if(!m1[x]){
		if(v[x] != 1)
		m1[x] = x;
		else
		m1[x] = m1[l(x)];
	}
	if(!m2[x]){
		if(v[x] != 2)
		m2[x] = x;
		else
		m2[x] = m2[l(x)];
	}
}


inline void dn(int x,int y){v[x] = v[x] + y;ans[x] = v[x] > 1;std::swap(m1[x],m2[x]);t[x] += y;} 
 
inline void pushdown(int x){
if(t[x]){
	dn(l(x),t[x]);
	dn(r(x),t[x]);
	t[x] = 0;
}}

ll st[N];

inline void rotate(int x){
	int y = f[x],z = f[y],k = r(y) == x,w = c[x][!k];
	if(nroot(y))c[z][r(z) == y] = x;c[x][!k] = y;c[y][k] = w;
	if(w)f[w] = y;f[y] = x;f[x] = z;
	up(y),up(x);
}

inline void splay(int x){
	ll y = x,z = 0;
	st[++z] = y;
	while(nroot(y))st[++z] = y = f[y];
	while(z)pushdown(st[z -- ]);
	while(nroot(x)){
		ll y = f[x],z = f[y];
		if(nroot(y))
		rotate((l(z) == y) ^ (l(y) == x) ? x : y);
		rotate(x);
	}  
	up(x);
}

inline void access(int x){
	for(int y = 0;x;x = f[y = x]){
		splay(x),r(x) = y,up(x);
	}
}

struct P{int to,next;}e[N * 6]; 

ll head[3 * N],cnt;

inline void add(int x,int y){
	e[++cnt].to = y;
	e[cnt].next = head[x];
	head[x] = cnt; 
}

ll n;

inline void dfs(int u,int fa){
	v[u] = 0;
	for(int i = head[u];i;i = e[i].next){
		int vi = e[i].to;
		if(vi == fa)
		continue;
		dfs(vi,u);
		v[u] += ans[vi];
	}
	if(u <= n)ans[u] = v[u] > 1;
}

int main(){
	scanf("%lld",&n);
	for(int i = 1;i <= n;++i){
		for(int j = 1;j <= 3;++j){
			ll x;
			scanf("%lld",&x);
			f[x] = i;
			add(i,x);
			add(x,i);
		} 
	}
	for(int i = n + 1;i <= n * 3 + 1;++i)
	scanf("%lld",&ans[i]);
	dfs(1,0);
	ll m;
	ll art = ans[1];
	scanf("%lld",&m);
	while(m -- ){
		ll now;
		scanf("%lld",&now);
		ll x = f[now];
		ll tag = ans[now] ? -1 : 1;
		access(x),splay(x);
		ll w = 0;
		w = (ans[now] ? m2[x] : m1[x]);
		if(w){
			splay(w);
			dn(r(w),tag),up(r(w));
			v[w] += tag;ans[w] = v[w] > 1;up(w); 
		}
		else{
			art ^= 1,dn(x,tag),up(x);
		}
		ans[now] ^= 1;
		std::cout<<art<<std::endl;
	}
}