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 JAVA):

Solution:

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class A
{

	static ArrayList<Integer> adj[];
	static int n , t;
	static boolean[] vis;
	static int[] E , L , tin , tout;

	static void dfs(int u , int depth){
		tin[u] = t;
		E[t] = u;
		L[t] = depth;
		t++;
		for(int v : adj[u])
			if(!vis[v])
			{
				vis[v] = true;
				dfs(v , depth+1);
				E[t] = u;
				L[t] = depth;
				//				t++;
			}
		tout[u] = t - 1;
	}

	static void eulerTour(int root){
		t = 0;
		vis = new boolean[n];
		E = new int[n<<1];				// E[i] = node entered at time i								function of time
		L = new int[n<<1];				// L[i] = Level of node E[i] (node entered at time i)			function of time
		tin = new int[n];			// tin[i] = earliest time we entered node i
		tout = new int[n];			// tout[i] = last time we visited node i
		Arrays.fill(tin, -1);
		Arrays.fill(tout, -1);
		vis[root] = true;
//		System.out.println(Arrays.toString(E));
		dfs(root , 0);
	}

	public static void main(String[] args) throws IOException
	{
		Scanner sc = new Scanner(System.in);
		PrintWriter pw = new PrintWriter(System.out);

		n = sc.nextInt();
		t = 1;
		adj = new ArrayList[n];
		for(int i=0;i<n;i++)
			adj[i] = new ArrayList<>();
		for(int i=1;i<n;i++)
		{
			int x = sc.nextInt()-1;
			adj[x].add(i);
			adj[i].add(x);
		}

		//		System.out.println(Arrays.toString(adj));
		eulerTour(0);
//		System.out.println(Arrays.toString(tin));
//		System.out.println(Arrays.toString(tout));

		int N = 1;
		while(N < n)
			N<<=1;
		int[] arr = new int[N+1];
		int[] tmp = new int[n];
		for(int i=0;i<n;i++)
			tmp[i] = sc.nextInt();
//		System.out.println(Arrays.toString(E));
		for(int i=0;i<n;i++)
			arr[i+1] = tmp[E[i]];
//		System.out.println(Arrays.toString(arr));
		SegmentTree st = new SegmentTree(arr);
		int q = sc.nextInt();
		while(q-- > 0){
			String s = sc.next();
			if(s.charAt(0) == 'g'){
				int x = sc.nextInt() - 1;
				pw.println(st.query(tin[x]+1, tout[x]+1));
			}
			else{
				int x = sc.nextInt()-1;
				st.update_range(tin[x]+1, tout[x]+1);
			}
		}
		pw.flush();

	}

	static class Scanner
	{
		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s)
		{
			br = new BufferedReader(new InputStreamReader(s));
		}

		public String next() throws IOException
		{
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
		}

		public long nextLong() throws IOException
		{
			return Long.parseLong(next());
		}

		public String nextLine() throws IOException
		{
			return br.readLine();
		}

		public double nextDouble() throws IOException
		{
			return Double.parseDouble(next());
		}

		public boolean ready() throws IOException
		{
			return br.ready();
		}
	}

	static class SegmentTree
	{ // 1-based DS, OOP

		int N;
		int[] array, sTree, lazy;

		SegmentTree(int[] in)
		{
			array = in;
			N = in.length - 1;
			sTree = new int[N << 1];
			lazy = new int[N << 1];
			build(1, 1, N);
		}

		void build(int node, int b, int e) // O(n)
		{
			if (b == e)
				sTree[node] = array[b];
			else
			{
				build(node << 1, b, (b + e) / 2);
				build((node << 1) + 1, (b + e) / 2 + 1, e);
				sTree[node] = sTree[node << 1] + sTree[(node << 1) + 1];
			}
		}

		void update_point(int index, int val) // O(log n)
		{
			index += N - 1;
			sTree[index] += val;
			while (index > 1)
			{
				index >>= 1;
				sTree[index] = sTree[index << 1] + sTree[(index << 1) + 1];
			}
		}

		void update_range(int i, int j) // O(log n)
		{
			update_range(1, 1, N, i, j);
		}

		void update_range(int node, int b, int e, int i, int j)
		{
			if (i > e || j < b)
				return;
			if (b >= i && e <= j)
			{
				sTree[node] = (e - b + 1) - sTree[node];
				lazy[node] ^= 1;
			} else
			{
				propagate(node, b, e);
				update_range(node << 1, b, (b + e) / 2, i, j);
				update_range((node << 1) + 1, (b + e) / 2 + 1, e, i, j);
				sTree[node] = sTree[node << 1] + sTree[(node << 1) + 1];
			}
		}

		void propagate(int node, int b, int e)
		{
			int mid = (b + e) / 2;
			lazy[node << 1] ^= lazy[node];
			lazy[(node << 1) + 1] ^= lazy[node];
			if(lazy[node] != 0)
			{
				sTree[node << 1] = (mid - b + 1) - sTree[node << 1];
				sTree[(node << 1) + 1] = (e - mid) * lazy[node]- sTree[(node << 1) + 1];
			}
			lazy[node] = 0;
		}

		int query(int i, int j)
		{
			return query(1, 1, N, i, j);
		}

		int query(int node, int b, int e, int i, int j) // O(log n)
		{
			if (i > e || j < b)
				return 0;
			if (b >= i && e <= j)
				return sTree[node];
			propagate(node, b, e);
			int q1 = query(node << 1, b, (b + e) / 2, i, j);
			int q2 = query((node << 1) + 1, (b + e) / 2 + 1, e, i, j);
//			System.out.println("q1   " + q1);
//			System.out.println("q2    " + q2);
			return q1 + q2;
		}
	}
}