#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;

int n, q, cid = 0;
int op, x;
int fa[300005];
vector<int> a[300005];
int val[300005];
int dfn[300005], out[300005];

void erg(int u){
    dfn[u] = ++ cid;
    for (auto && i : a[u]){
        erg(i);
    }
    out[u] = cid;
    // cout << u << " " << dfn[u] << " " << out[u] << "\n";
}

void update(int p, int l, int r){
    for (int i = l; i <= r; i ++){
        val[i] ^= 1;
    }
}

int query(int p, int l, int r){
    int res = 0;
    for (int i = l; i <= r; i ++){
        res += val[i];
    }
    return res;
}

int main(){
#ifndef ONLINE_JUDGE
    freopen("../data.in","r",stdin);
    freopen("../data.out","w",stdout);
#endif
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    scanf("%d", &n);
    for (int i = 2; i <= n; i ++){
        scanf("%d", &fa[i]);
        a[fa[i]].push_back(i);
    }
    erg(1);
    for (int i = 1; i <= n; i ++){
        scanf("%d", &val[dfn[i]]);
    }
    scanf("%d", &q);
    while (q --){
        scanf("%d %d", &op, &x);
        if (op == 1){
            printf("%d\n", query(1, dfn[x], out[x]));
        }else{
            update(1, dfn[x], out[x]);
        }
    }

    return 0;
}