WA on #4

#include<bits/stdc++.h>
using namespace std;
#define lid (id << 1)
#define rid (id << 1 | 1)
#define ll long long
const int N = 2e5+5;
struct node{
	int l, r;
	int sum, lazy;
}tr[N << 2];
int n, q;
int head[N], nxt[N << 1], to[N << 1], cccnnnttt;
int dfn[N], rnk[N], siz[N], hson[N], cnt, top[N], val[N], dep[N], fa[N];
int a[N];
void add1(int u, int v){
	to[++cccnnnttt] = v;
	nxt[cccnnnttt] = head[u];
	head[u] = cccnnnttt;
}
void dfs1(int u, int f){
	int maxson = -1;
	hson[u] = -1;
	siz[u] = 1;
	for (int i = head[u];i;i = nxt[i]){
		int v = to[i];
		if (v == f) continue;
		dep[v] = dep[u] + 1;
		fa[v] = u;
		dfs1(v, u);
		siz[u] += siz[v];
		if (siz[v] > maxson) maxson = siz[v], hson[u] = v;
	}
}
void dfs2(int u, int t){
	top[u] = t;
	dfn[u] = ++cnt;
	rnk[cnt] = u;
	a[cnt] = val[u];
	if (hson[u] == -1) return;
	dfs2(hson[u], t);
	for (int i = head[u];i;i = nxt[i]){
		int v = to[i];
		if (v != fa[u] && v != hson[u]) dfs2(v, v);
	}
}
void pushup(int id){
	tr[id].sum = tr[lid].sum + tr[rid].sum;
}
void pushdown(int id){
	if (tr[id].lazy){
		tr[lid].lazy ^= 1;
		tr[rid].lazy ^= 1;
		tr[lid].sum = (tr[lid].r - tr[lid].l + 1) - tr[lid].sum;
		tr[rid].sum = (tr[rid].r - tr[rid].l + 1) - tr[rid].sum;
		tr[id].lazy = 0;
	}
}
void build(int id, int l, int r){
	tr[id].l = l;
	tr[id].r = r;
	tr[id].lazy = 0;
	if (l == r){
		tr[id].sum = a[l];
		return;
	}
	int mid = (l + r) >> 1;
	build(lid, l, mid);
	build(rid, mid + 1, r);
	pushup(id);
}
void add(int id, int l, int r){
	if (l <= tr[id].l && tr[id].r <= r){
		tr[id].lazy ^= 1;
		tr[id].sum = (tr[id].r - tr[id].l + 1) - tr[id].sum;
		return;
	}
	pushdown(id);
	int mid = (tr[id].l + tr[id].r) >> 1;
	if (r <= mid) add(lid, l, r);
	else if (l > mid) add(rid, l, r);
	else add(lid, l, mid), add(rid, mid + 1, r);
	pushup(id);
}
int query(int id, int l, int r){
	if (l <= tr[id].l && tr[id].r <= r) return tr[id].sum;
	pushdown(id);
	int mid = (tr[id].l + tr[id].r) >> 1;
	if (r <= mid) return query(lid, l, r);
	else if (l > mid) return query(rid, l, r);
	else query(lid, l, mid), query(rid, mid + 1, r);
}
void addsubtree(int x){
	add(1, dfn[x], dfn[x] + siz[x] - 1);
}
int querysubtree(int x){
	return query(1, dfn[x], dfn[x] + siz[x] - 1);
}
int main(){
	cin >> n;
	for (int i = 2;i <= n;i++){
		int v;
		cin >> v;
		add1(i, v);
		add1(v, i);
	}
	for (int i = 1;i <= n;i++) cin >> val[i];
	dep[1] = 1;
	dfs1(1, 0);
	dfs2(1, 1);
	build(1, 1, n);
	cin >> q;
	while (q--){
		string s;
		int x;
		cin >> s >> x;
		if (s == "get"){
			cout << querysubtree(x)<< '\n';
		}
		else{
			addsubtree(x);
		}
	}
	return 0;
}