Problem: Danil decided to earn some money, so he had found a part-time job. The interview have went well, so now he is a light switcher.

Danil works in a rooted tree (undirected connected acyclic graph) with n vertices, vertex 1 is the root of the tree. There is a room in each vertex, light can be switched on or off in each room. Danil's duties include switching light in all rooms of the subtree of the vertex. It means that if light is switched on in some room of the subtree, he should switch it off. Otherwise, he should switch it on.

Unfortunately (or fortunately), Danil is very lazy. He knows that his boss is not going to personally check the work. Instead, he will send Danil tasks using Workforces personal messages.

There are two types of tasks: 

  1. pow v describes a task to switch lights in the subtree of vertex v.
  2. get v describes a task to count the number of rooms in the subtree of v, in which the light is turned on. Danil should send the answer to his boss using Workforces messages.



A subtree of vertex v is a set of vertices for which the shortest path from them to the root passes through v. In particular, the vertex v is in the subtree of v.

Danil is not going to perform his duties. He asks you to write a program, which answers the boss instead of him.

Input

The first line contains a single integer n (1 ≤ n ≤ 200 000) — the number of vertices in the tree.

The second line contains n - 1 space-separated integers p2, p3, ..., pn (1 ≤ pi < i), where pi is the ancestor of vertex i.

The third line contains n space-separated integers t1, t2, ..., tn (0 ≤ ti ≤ 1), where ti is 1, if the light is turned on in vertex i and 0 otherwise.

The fourth line contains a single integer q (1 ≤ q ≤ 200 000) — the number of tasks.

The next q lines are get v or pow v (1 ≤ v ≤ n) — the tasks described above.

Output

For each task get v print the number of rooms in the subtree of v, in which the light is turned on.

Example

Input

4
1 1 1
1 0 0 1
9
get 1
get 2
get 3
get 4
pow 1
get 1
get 2
get 3
get 4


Output

2
0
0
1
2
1
1
0

Note

<image> The tree before the task pow 1.

<image> The tree after the task pow 1.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
vector<int> v[200010];
int val[200010];
int inicio[200010];
int fim[200010];
int segt[3 * 200010][2];
bool lp[3 * 200010];
vector<int> traversal;
void dfs(int x) {
  inicio[x] = traversal.size();
  traversal.push_back(x);
  for (int i = 0; i < v[x].size(); ++i) {
    dfs(v[x][i]);
  }
  fim[x] = traversal.size() - 1;
}
void maybe_updt_lazy(int l, int r, int node) {
  if (lp[node]) {
    swap(segt[node][0], segt[node][1]);
    if (l != r) {
      lp[(node << 1) + 1] = !lp[(node << 1) + 1];
      lp[(node << 1) + 2] = !lp[(node << 1) + 2];
    }
    lp[node] = 0;
  }
}
void build(int l, int r, int node) {
  lp[node] = 0;
  if (l == r) {
    segt[node][0] = (val[traversal[l]] == 0);
    segt[node][1] = (val[traversal[l]] == 1);
    return;
  }
  int mid = (l + r) / 2;
  build(l, mid, (node << 1) + 1);
  build(mid + 1, r, (node << 1) + 2);
  segt[node][0] = segt[(node << 1) + 1][0] + segt[(node << 1) + 2][0];
  segt[node][1] = segt[(node << 1) + 1][1] + segt[(node << 1) + 2][1];
}
void update_range(int l, int r, int node, int lu, int ru) {
  maybe_updt_lazy(l, r, node);
  if (lu > r || l > ru) return;
  if (lu <= l && r <= ru) {
    swap(segt[node][0], segt[node][1]);
    if (l != r) {
      lp[(node << 1) + 1] = !lp[(node << 1) + 1];
      lp[(node << 1) + 2] = !lp[(node << 1) + 2];
    }
  } else {
    int mid = (l + r) / 2;
    update_range(l, mid, (node << 1) + 1, lu, ru);
    update_range(mid + 1, r, (node << 1) + 2, lu, ru);
    segt[node][0] = segt[(node << 1) + 1][0] + segt[(node << 1) + 2][0];
    segt[node][1] = segt[(node << 1) + 1][1] + segt[(node << 1) + 2][1];
  }
}
int query(int l, int r, int node, int lq, int rq) {
  maybe_updt_lazy(l, r, node);
  if (rq < l || lq > r)
    return 0;
  else if (l >= lq && r <= rq)
    return segt[node][1];
  else {
    int mid = (l + r) / 2;
    int left_query = query(l, mid, (node << 1) + 1, lq, rq);
    int right_query = query(mid + 1, r, (node << 1) + 2, lq, rq);
    return left_query + right_query;
  }
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i < n; ++i) {
    int x;
    scanf("%d", &x);
    v[--x].push_back(i);
  }
  dfs(0);
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    val[i] = x;
  }
  build(0, n - 1, 0);
  int m;
  cin >> m;
  for (int i = 0; i < m; ++i) {
    string s;
    cin >> s;
    int x;
    cin >> x;
    x--;
    if (s[0] == 'g') {
      cout << query(0, n - 1, 0, inicio[x], fim[x]) << endl;
    } else {
      update_range(0, n - 1, 0, inicio[x], fim[x]);
    }
  }
}