#include <bits/stdc++.h>
using namespace std;
vector<int> g[200005];
int cont, d[200005], v[200005], st[200005 << 2], lazy[200005 << 2], L[200005],
    R[200005], vet[200005];
void dfs(int u, int pai) {
  v[cont] = vet[u];
  cont++;
  L[u] = cont - 1;
  for (int i = 0; i < g[u].size(); i++) {
    int v = g[u][i];
    if (v == pai) continue;
    dfs(v, u);
  }
  R[u] = cont - 1;
}
void build(int p, int l, int r) {
  if (l == r) {
    st[p] = v[l];
    return;
  }
  int mid = (l + r) >> 1;
  build(p << 1, l, mid);
  build((p << 1) + 1, mid + 1, r);
  st[p] = st[(p << 1)] + st[(p << 1) + 1];
}
void prop(int p, int l, int r) {
  st[p] = (r - l + 1) - st[p];
  if (l != r) {
    lazy[(p << 1)] ^= 1;
    lazy[(p << 1) + 1] ^= 1;
  }
  lazy[p] = 0;
}
void update(int p, int l, int r, int a, int b) {
  if (lazy[p] == 1) prop(p, l, r);
  if (l > b || r < a) return;
  if (l >= a && r <= b) {
    lazy[p] = 1;
    prop(p, l, r);
    return;
  }
  int mid = (l + r) >> 1;
  update((p << 1), l, mid, a, b);
  update((p << 1) + 1, mid + 1, r, a, b);
  st[p] = st[(p << 1)] + st[(p << 1) + 1];
}
int query(int p, int l, int r, int a, int b) {
  if (lazy[p] == 1) prop(p, l, r);
  if (l > b || r < a) return 0;
  if (l >= a && r <= b) return st[p];
  int mid = (l + r) >> 1;
  return (query((p << 1), l, mid, a, b) +
          query((p << 1) + 1, mid + 1, r, a, b));
}
int main() {
  int n;
  cin >> n;
  cont = 0;
  for (int i = 1; i < n; i++) {
    int x;
    cin >> x;
    x--;
    g[i].push_back(x);
    g[x].push_back(i);
  }
  for (int i = 0; i < n; i++) {
    cin >> vet[i];
  }
  dfs(0, -1);
  memset(lazy, 0, sizeof lazy);
  build(1, 0, n - 1);
  int q;
  cin >> q;
  while (q--) {
    string s;
    cin >> s;
    if (s == "get") {
      int u;
      cin >> u;
      u--;
      cout << query(1, 0, n - 1, L[u], R[u]) << endl;
    } else {
      int u;
      cin >> u;
      u--;
      update(1, 0, n - 1, L[u], R[u]);
    }
  }
}
