#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
const long long K = 2;
long long n;
vector<long long> v[200005];
long long ar[200005];
long long st[200005], en[200005], fl[200005], seg[1000005], lazy[1000005];
long long tim = 0;
void dfs(long long x, long long pa) {
  fl[tim] = x;
  st[x] = tim;
  tim++;
  for (auto ii : v[x]) {
    if (pa != ii) dfs(ii, x);
  }
  en[x] = tim - 1;
}
void laz(long long id, long long st, long long en) {
  if (lazy[id] == 1) {
    seg[id] = (en - st + 1) - seg[id];
    if (st != en) {
      lazy[2 * id + 1] ^= 1;
      lazy[2 * id + 2] ^= 1;
    }
    lazy[id] = 0;
  }
  return;
}
void build(long long st, long long en, long long id) {
  if (st == en) {
    seg[id] = ar[fl[st]];
    return;
  }
  long long mi = (st + en) / 2;
  build(st, mi, 2 * id + 1);
  build(mi + 1, en, 2 * id + 2);
  seg[id] = seg[2 * id + 1] + seg[2 * id + 2];
}
void upd(long long st, long long en, long long id, long long l, long long r) {
  laz(id, st, en);
  if (r < st || l > en) return;
  if (st >= l && en <= r) {
    seg[id] = (en - st + 1) - seg[id];
    if (st != en) {
      lazy[2 * id + 1] ^= 1;
      lazy[2 * id + 2] ^= 1;
    }
    return;
  }
  long long mi = (st + en) / 2;
  upd(st, mi, 2 * id + 1, l, r);
  upd(mi + 1, en, 2 * id + 2, l, r);
  seg[id] = seg[2 * id + 1] + seg[2 * id + 2];
}
long long qq(long long st, long long en, long long id, long long l,
             long long r) {
  laz(id, st, en);
  if (r < st || l > en) return 0;
  if (st >= l && en <= r) {
    return seg[id];
  }
  long long mi = (st + en) / 2;
  long long op1 = qq(st, mi, 2 * id + 1, l, r);
  long long op2 = qq(mi + 1, en, 2 * id + 2, l, r);
  return op1 + op2;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  for (long long i = 2; i <= n; i++) {
    long long x;
    cin >> x;
    v[x].push_back(i);
    v[i].push_back(x);
  }
  for (long long i = 1; i <= n; i++) cin >> ar[i];
  dfs(1, -1);
  build(0, n - 1, 0);
  long long q;
  cin >> q;
  while (q--) {
    string s;
    cin >> s;
    if (s == "pow") {
      long long y;
      cin >> y;
      upd(0, n - 1, 0, st[y], en[y]);
    } else {
      long long y;
      cin >> y;
      long long an = qq(0, n - 1, 0, st[y], en[y]);
      cout << an << endl;
    }
  }
  return 0;
}
