#include <bits/stdc++.h>
using namespace std;
const int N = 2E5 + 10;

int n, m;
bool a[N];
vector <int> G[N];

int ans = 0;
void dfs1(int x)
{
    if (a[x] == 1)
        ans ++;
    for (auto t : G[x])
        dfs1(t);
}
void dfs2(int x)
{
    a[x] = !a[x];
    for (auto t : G[x])
        dfs2(t);
}
int main()
{
    ios::sync_with_stdio(0),cin.tie(0);
    cin >> n;
    for (int i = 1; i <= n - 1; i ++ )
    {
        int x;
        cin >> x;
        G[x].push_back(i + 1);
    }
    for (int i = 1; i <= n; i ++ )
        cin >> a[i];
    cin >> m;
    int op, l;
    while (m -- )
    {
        cin >> op >> l;
        if (op == 1)
        {
            ans = 0;
            dfs1(l);
            cout << ans << '\n';
        }
        if (op == 2)
            dfs2(l);
        
    }
}