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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Pradyumn
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        FastReader in = new FastReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskE solver = new TaskE();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskE {
        public void solve(int testNumber, FastReader in, PrintWriter out) {
            int n = in.nextInt();
            int[] par = new int[n];
            par[0] = -1;
            for (int i = 1; i < n; i++) par[i] = in.nextInt() - 1;
            int[][] g = parentToG(par);
            int[] a = in.nextIntArray(n);
            int[][] rs = makeRights(g, par, 0);
            int[] iord = rs[1], right = rs[2];
            int[] b = new int[n];
            for (int i = 0; i < n; i++) {
                b[iord[i]] = a[i];
            }

            TaskE.SegmentTreeRXQ st = new TaskE.SegmentTreeRXQ(b);
            for (int Q = in.nextInt(); Q > 0; Q--) {
                String type = in.nextString();
                if (type.equals("get")) {
                    int x = in.nextInt() - 1;
                    out.println(st.count(iord[x], right[iord[x]] + 1));
                } else {
                    int x = in.nextInt() - 1;
                    st.flip(iord[x], right[iord[x]] + 1);
                }
            }
        }

        public static int[] sortByPreorder(int[][] g, int root) {
            int n = g.length;
            int[] stack = new int[n];
            int[] ord = new int[n];
            boolean[] ved = new boolean[n];
            stack[0] = root;
            int p = 1;
            int r = 0;
            ved[root] = true;
            while (p > 0) {
                int cur = stack[p - 1];
                ord[r++] = cur;
                p--;
                for (int e : g[cur]) {
                    if (!ved[e]) {
                        ved[e] = true;
                        stack[p++] = e;
                    }
                }
            }
            return ord;
        }

        public static int[][] makeRights(int[][] g, int[] par, int root) {
            int n = g.length;
            int[] ord = sortByPreorder(g, root);
            int[] iord = new int[n];
            for (int i = 0; i < n; i++) iord[ord[i]] = i;

            int[] right = new int[n];
            for (int i = n - 1; i >= 1; i--) {
                if (right[i] == 0) right[i] = i;
                int p = iord[par[ord[i]]];
                right[p] = Math.max(right[p], right[i]);
            }
            return new int[][]{ord, iord, right};
        }

        public static int[][] parentToG(int[] par) {
            int n = par.length;
            int[] ct = new int[n];
            for (int i = 0; i < n; i++) {
                if (par[i] >= 0) {
                    ct[i]++;
                    ct[par[i]]++;
                }
            }
            int[][] g = new int[n][];
            for (int i = 0; i < n; i++) {
                g[i] = new int[ct[i]];
            }
            for (int i = 0; i < n; i++) {
                if (par[i] >= 0) {
                    g[par[i]][--ct[par[i]]] = i;
                    g[i][--ct[i]] = par[i];
                }
            }
            return g;
        }

        public static class SegmentTreeRXQ {
            public int M;
            public int H;
            public int N;
            public boolean[] plus;
            public int[] ct;

            public SegmentTreeRXQ(int n) {
                N = n;
                H = Integer.highestOneBit(Math.max(n, 1)) << 1;
                M = H << 1;
                plus = new boolean[H];
                ct = new int[M];
            }

            public SegmentTreeRXQ(int[] a) {
                N = a.length;
                H = Integer.highestOneBit(Math.max(N, 1)) << 1;
                M = H << 1;
                plus = new boolean[H];
                ct = new int[M];
                System.arraycopy(a, 0, ct, H, N);
                for (int i = H - 1; i >= 1; i--) propagate(i);
            }

            private void propagate(int i) {
                if (plus[i]) {
                    int q = H / Integer.highestOneBit(i);
                    ct[i] = q - (ct[2 * i] + ct[2 * i + 1]);
                } else {
                    ct[i] = ct[2 * i] + ct[2 * i + 1];
                }
            }

            public void flip(int l, int r) {
                flip(l, r, 0, H, 1);
            }

            private void flip(int l, int r, int cl, int cr, int cur) {
                if (cur >= H) {
                    ct[cur] ^= 1;
                } else if (l <= cl && cr <= r) {
                    plus[cur] ^= true;
                    propagate(cur);
                } else {
                    int mid = cl + cr >>> 1;
                    if (cl < r && l < mid) {
                        flip(l, r, cl, mid, 2 * cur);
                    }
                    if (mid < r && l < cr) {
                        flip(l, r, mid, cr, 2 * cur + 1);
                    }
                    propagate(cur);
                }
            }

            public int count(int l, int r) {
                return l >= r ? 0 : count(l, r, 0, H, 1);
            }

            private int count(int l, int r, int cl, int cr, int cur) {
                if (l <= cl && cr <= r) {
                    return ct[cur];
                } else {
                    int mid = cl + cr >>> 1;
                    int ret = 0;
                    if (cl < r && l < mid) {
                        ret += count(l, r, cl, mid, 2 * cur);
                    }
                    if (mid < r && l < cr) {
                        ret += count(l, r, mid, cr, 2 * cur + 1);
                    }
                    return plus[cur] ? Math.min(r, cr) - Math.max(l, cl) - ret : ret;
                }
            }

        }

    }

    static class FastReader {
        private InputStream stream;
        private byte[] buf = new byte[8192];
        private int curChar;
        private int pnumChars;
        private FastReader.SpaceCharFilter filter;

        public FastReader(InputStream stream) {
            this.stream = stream;
        }

        private int pread() {
            if (pnumChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= pnumChars) {
                curChar = 0;
                try {
                    pnumChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (pnumChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = pread();
            }
            int res = 0;
            do {
                if (c == ',') {
                    c = pread();
                }
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = pread();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public int[] nextIntArray(int n) {
            int[] array = new int[n];
            for (int i = 0; i < n; i++) {
                array[i] = nextInt();
            }
            return array;
        }

        public String nextString() {
            int c = pread();
            while (isSpaceChar(c))
                c = pread();
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = pread();
            } while (!isSpaceChar(c));
            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        private static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        private interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}