#include <bits/stdc++.h>
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
int read() {
  char ch = getchar();
  int x = 0, f = 1;
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
const int N = 2e5 + 10;
int n, q;
int st[N], ed[N];
int sum[N << 2], lazy[N << 2];
struct {
  int to, next;
} edge[N];
int head[N];
int cnt = 0;
int num = 0;
void addedge(int fr, int to) {
  edge[cnt].to = to;
  edge[cnt].next = head[fr];
  head[fr] = cnt++;
}
void dfs(int u) {
  st[u] = ++num;
  for (int i = head[u]; ~i; i = edge[i].next) {
    dfs(edge[i].to);
  }
  ed[u] = num;
}
void pushup(int root) { sum[root] = sum[root << 1] + sum[root << 1 | 1]; }
void pushdown(int root, int l, int r) {
  int len = (r - l + 1);
  int lenl = len - (len >> 1);
  int lenr = (len) >> 1;
  if (lazy[root] % 2) {
    lazy[root << 1] += lazy[root];
    lazy[root << 1 | 1] += lazy[root];
    sum[root << 1] = lenl - sum[root << 1];
    sum[root << 1 | 1] = lenr - sum[root << 1 | 1];
    lazy[root] = 0;
  }
}
void build(int l, int r, int root) {
  lazy[root] = 0;
  if (l == r) {
    sum[root] = 0;
    return;
  }
  int mid = (l + r) >> 1;
  build(l, mid, root << 1);
  build(mid + 1, r, root << 1 | 1);
  pushup(root);
}
void init(int l, int r, int root, int pos, int val) {
  if (l == r) {
    sum[root] = val;
    return;
  }
  int mid = (l + r) >> 1;
  if (pos <= mid)
    init(l, mid, root << 1, pos, val);
  else
    init(mid + 1, r, root << 1 | 1, pos, val);
  pushup(root);
}
void update(int l, int r, int root, int lf, int rt) {
  if (lf <= l && r <= rt) {
    sum[root] = (r - l + 1) - sum[root];
    lazy[root]++;
    return;
  }
  pushdown(root, l, r);
  int mid = (l + r) >> 1;
  if (lf <= mid) update(l, mid, root << 1, lf, rt);
  if (rt > mid) update(mid + 1, r, root << 1 | 1, lf, rt);
  pushup(root);
}
int querry(int l, int r, int root, int lf, int rt) {
  if (lf <= l && r <= rt) return sum[root];
  pushdown(root, l, r);
  int mid = (l + r) >> 1;
  int ans = 0;
  if (lf <= mid) ans += querry(l, mid, root << 1, lf, rt);
  if (rt > mid) ans += querry(mid + 1, r, root << 1 | 1, lf, rt);
  return ans;
}
int main() {
  memset(head, -1, sizeof(head));
  n = read();
  int x;
  for (int i = 2; i <= n; i++) {
    x = read();
    addedge(x, i);
  }
  build(1, n, 1);
  dfs(1);
  for (int i = 0; i < n; i++) {
    x = read();
    init(1, n, 1, st[i + 1], x);
  }
  q = read();
  char s[20];
  while (q--) {
    scanf("%s", s);
    if (s[0] == 'g') {
      x = read();
      cout << querry(1, n, 1, st[x], ed[x]) << endl;
    } else {
      x = read();
      update(1, n, 1, st[x], ed[x]);
    }
  }
  return 0;
}
