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:
/**
 * Created by Shae on 10/23/2017.
 */

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;

public class E {
    static List<Integer> list[] ;
    static int n, start[], end[], a[];
    static ArrayList<Integer> order = new ArrayList<>();
    public static void main(String[] args)throws Exception {
        FastReader in = new FastReader(System.in);
        PrintWriter pw = new PrintWriter(System.out);

        n = in.nextInt();
        start = new int[n+1];
        end = new int[n+1];
        a = new int[n+1];
        list = new List[n+1];


        for(int i = 0; i <= n; i++){
            list[i] = new ArrayList<>();
        }


        for(int i = 2; i <= n; i++){
            int u = in.nextInt(), v = i;
            list[u].add(v);
            list[v].add(u);
        }

        for(int i = 1; i <= n; i++){
            a[i] = in.nextInt();
        }


        dfs(0, 1);
       // debug(start);
      //  debug(end);

        SegTree seg = new SegTree(time);
        seg.build();

        int q = in.nextInt();
        for(int i = 0; i < q; i++){
            String s = in.next();
            int x = in.nextInt();
            if(s.charAt(0) == 'p') seg.update(x);
            else pw.println(seg.query(x));
        }




        pw.close();
    }

    static class SegTree{
        int size = (int)2e6;
        int n, seg[] = new int[size], lazy[] = new int[size], tot[] = new int[size];
        SegTree(int N){
            n = N;
        }

        void build(){
            build(1, 1, n);
        }

        void build(int p, int s, int e){
            if(s == e){
                seg[p] = a[order.get(s-1)];
                tot[p] = 1;
                return;
            }
            if(s > e) return;
            int m = (s+e)/2, l = 2*p, r = l+1;
            build(l, s, m);
            build(r, m+1, e);
            seg[p] = seg[l] + seg[r];
            tot[p] = tot[l] + tot[r];
        }

        void push_down(int p, int l, int r){
            if(lazy[p] == 0) return;
            lazy[p] = 0;
            lazy[l] ^= 1;
            lazy[r] ^= 1;
            seg[l] = tot[l] - seg[l];
            seg[r] = tot[r] - seg[r];
        }

        void update(int p){
            update(1, 1, n, start[p], end[p]);
        }

        void update(int p, int s, int e, int a, int b){
            if(s >= a && e <= b){
                lazy[p] ^= 1;
                seg[p] = tot[p] - seg[p];
                return;
            }
            if(s > e || s > b || e < a) return;
            int m = (s+e)/2, l = 2*p, r = l+1;
            push_down(p, l, r);
            update(l, s, m, a, b);
            update(r, m+1, e, a, b);
            seg[p] = seg[l] + seg[r];
        }

        int query(int p){
            return query(1, 1, n, start[p], end[p]);
        }

        int query(int p, int s, int e, int a, int b){
            if(s >= a && e <= b){
                return seg[p];
            }
            if(s > e || s > b || e < a) return 0;
            int m = (s+e)/2, l = 2*p, r = l+1;
            push_down(p, l, r);
            return query(l, s, m, a, b) + query(r, m+1, e,  a, b);
        }

    }

    static int time = 0;
    static void dfs(int p, int u){
        start[u] = ++time;
        order.add(u);
        for(int v : list[u]){
            if(v != p) dfs(u, v);
        }
        end[u] = time;
    }

    static void debug(Object...obj) {
        System.err.println(Arrays.deepToString(obj));
    }

    static class FastReader {
        InputStream is;
        private byte[] inbuf = new byte[1024];
        private int lenbuf = 0, ptrbuf = 0;
        static final int ints[] = new int[128];

        public FastReader(InputStream is){
            for(int i='0';i<='9';i++) ints[i]=i-'0';
            this.is = is;
        }

        public int readByte(){
            if(lenbuf == -1)throw new InputMismatchException();
            if(ptrbuf >= lenbuf){
                ptrbuf = 0;
                try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
                if(lenbuf <= 0)return -1;
            }
            return inbuf[ptrbuf++];
        }

        public boolean isSpaceChar(int c) {
            return !(c >= 33 && c <= 126);
        }
        public int skip() {
            int b;
            while((b = readByte()) != -1 && isSpaceChar(b));
            return b;
        }

        public String next(){
            int b = skip();
            StringBuilder sb = new StringBuilder();
            while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }

        public int nextInt(){
            int num = 0, b;
            boolean minus = false;
            while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
            if(b == '-'){
                minus = true;
                b = readByte();
            }

            while(true){
                if(b >= '0' && b <= '9'){
                    num = (num<<3) + (num<<1) + ints[b];
                }else{
                    return minus ? -num : num;
                }
                b = readByte();
            }
        }

        public long nextLong() {
            long num = 0;
            int b;
            boolean minus = false;
            while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
            if(b == '-'){
                minus = true;
                b = readByte();
            }

            while(true){
                if(b >= '0' && b <= '9'){
                    num = (num<<3) + (num<<1) + ints[b];
                }else{
                    return minus ? -num : num;
                }
                b = readByte();
            }
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }
       /* public char nextChar() {
            return (char)skip();
        }*/

        public char[] next(int n){
            char[] buf = new char[n];
            int b = skip(), p = 0;
            while(p < n && !(isSpaceChar(b))){
                buf[p++] = (char)b;
                b = readByte();
            }
            return n == p ? buf : Arrays.copyOf(buf, p);
        }

        /*private char buff[] = new char[1005];
        public char[] nextCharArray(){
            int b = skip(), p = 0;
            while(!(isSpaceChar(b))){
                buff[p++] = (char)b;
                b = readByte();
            }
            return Arrays.copyOf(buff, p);
        }*/
    }
}