#include <bits/stdc++.h>
#define MAXN ((int)(2e5 + 10))
using namespace std;

int n, m, op, x;
struct treenodes
{
  int father, val;
  vector<int> descendants;
} tree[MAXN];

int main(int argc, char const *argv[])
{
#ifdef HERITAGE_OFFICIAL
  freopen("_data.in", "r", stdin);
  // freopen("_data.out", "w", stdout);
#endif
  scanf("%d", &n);
  for (int i = 2; i <= n; i++)
    scanf("%d", &tree[i].father);
  for (int i = 2; i <= n; i++)
  {
    x = tree[i].father;
    while (x)
    {
      tree[x].descendants.push_back(i);
      x = tree[x].father;
    }
  }
  for (int i = 1; i <= n; i++)
    scanf("%d", &tree[i].val);
  scanf("%d", &m);
  while (m--)
  {
    scanf("%d%d", &op, &x);
    if (op == 1)
    {
      int ans = 0;
      for (int i = 0; i < tree[x].descendants.size(); i++)
        ans += tree[tree[x].descendants[i]].val;
      ans += tree[x].val;
      printf("%d\n", ans);
    }
    else
    {
      for (int i = 0; i < tree[x].descendants.size(); i++)
        tree[tree[x].descendants[i]].val = (tree[tree[x].descendants[i]].val + 1) & 1;
      tree[x].val = (tree[x].val + 1) & 1;
    }
  }
  return 0;
}