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*.1.  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.
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 *p*<sub class="lower-index">2</sub>, *p*<sub class="lower-index">3</sub>, ..., *p*<sub class="lower-index">*n*</sub> (1 ≤ *p*<sub class="lower-index">*i*</sub> &lt; *i*), where *p*<sub class="lower-index">*i*</sub> is the ancestor of vertex *i*.

The third line contains *n* space-separated integers *t*<sub class="lower-index">1</sub>, *t*<sub class="lower-index">2</sub>, ..., *t*<sub class="lower-index">*n*</sub> (0 ≤ *t*<sub class="lower-index">*i*</sub> ≤ 1), where *t*<sub class="lower-index">*i*</sub> 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.
<img class="tex-graphics" src="https://espresso.codeforces.com/839c4a0a06cc547ffb8d937bfe52730b51c842b4.png" style="max-width: 100.0%;max-height: 100.0%;"/> The tree after the task pow 1.
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
2
0
0
1
2
1
1
0
1

1
4
pow 1
get 1
pow 1
get 1
0
1
10
1 2 3 4 2 4 1 7 8
1 1 0 1 1 0 0 0 1 1
10
pow 1
get 2
pow 2
pow 8
get 6
pow 6
pow 10
get 6
pow 8
pow 3
3
0
1
10
1 1 1 4 5 3 5 6 3
0 0 0 0 0 0 1 0 0 0
10
get 2
get 4
get 7
get 3
pow 2
pow 5
pow 2
get 7
pow 6
get 10
0
0
1
1
1
0
10
1 1 3 1 3 1 4 6 3
0 1 1 1 1 1 1 1 0 0
10
get 9
get 10
get 4
get 5
get 5
get 5
get 10
get 7
get 5
get 2
0
0
2
1
1
1
0
1
1
1
10
1 2 3 3 5 5 7 7 8
0 0 0 0 1 1 1 1 0 0
10
pow 3
get 1
pow 9
get 1
get 1
get 8
pow 8
pow 4
get 10
pow 2
4
3
3
1
0
10
1 2 3 3 5 5 7 7 9
1 1 0 1 0 0 1 0 0 0
10
get 2
get 6
get 4
get 2
get 1
get 2
get 6
get 9
get 10
get 7
3
0
1
3
4
3
0
0
0
1
10
1 1 2 2 3 3 5 5 6
1 1 1 1 0 0 1 1 0 0
10
get 2
get 8
get 10
get 5
get 5
pow 10
get 10
get 1
get 7
pow 4
3
1
0
1
1
1
7
1
10
1 1 2 2 3 3 4 4 5
1 1 0 1 0 0 0 0 0 0
10
get 2
get 5
pow 2
pow 4
get 2
get 4
pow 7
get 10
pow 5
get 6
2
0
3
1
1
0
# ------------------- fast io --------------------
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0
    
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# ------------------- fast io --------------------
from math import ceil


def prod(a, mod=10 ** 9 + 7):
    ans = 1
    for each in a:
        ans = (ans * each) % mod
    return ans


def gcd(x, y):
    while y:
        x, y = y, x % y
    return x


def lcm(a, b): return a * b // gcd(a, b)


def binary(x, length=16):
    y = bin(x)[2:]
    return y if len(y) >= length else "0" * (length - len(y)) + y


func_lazy = lambda a, b, c, d: ((a * c), (b + a * d))
func_data = lambda a, b, val: (a * val + b)


class LazySegmentTree:
    def __init__(self, data, padding=0, func=lambda a, b: a + b):
        """initialize the lazy segment tree with data"""
        self._func = func
        self._len = len(data)
        self._size = _size = 1 << (self._len - 1).bit_length()
        
        self.data = [padding] * (2 * _size)
        self.data[_size:_size + self._len] = data
        for i in reversed(range(1, _size)):
            self.data[i] = (self.data[2 * i] + self.data[2 * i + 1]) % 2
            # TODO
        self._lazy = [1, 0] * (2 * _size)
    
    def _push(self, idx):
        """push query on idx to its children"""
        # Let the children know of the queries
        # TODO
        idx *= 2
        a = self._lazy[idx]
        b = self._lazy[idx + 1]
        if (a, b) != (1, 0):
            b >>= 1
            self._lazy[idx] = 1
            self._lazy[idx + 1] = 0
            
            self.data[idx] = (a * self.data[idx] + b) % 2
            self.data[idx + 1] = (a * self.data[idx + 1] + b) % 2
            
            idx *= 2
            self._lazy[idx], self._lazy[idx + 1] = func_lazy(a, b, self._lazy[idx], self._lazy[idx + 1])
            self._lazy[idx + 2], self._lazy[idx + 3] = func_lazy(a, b, self._lazy[idx + 2], self._lazy[idx + 3])
    
    def _build(self, idx):
        """make the changes to idx be known to its ancestors"""
        idx >>= 1
        while idx:
            # TODO
            # self._push(idx)
            a = self._lazy[2 * idx]
            b = self._lazy[2 * idx + 1]
            self.data[idx] = (a * (self.data[2 * idx] + self.data[2 * idx + 1]) + b) % 2
            idx >>= 1
    
    def _update(self, idx):
        """updates the node idx to know of all queries applied to it via its ancestors"""
        for i in reversed(range(1, idx.bit_length())):
            self._push(idx >> i)
    
    def update(self, start, stop, x):
        self.updateval(start, stop, 0, x)
    
    def add(self, start, stop, x):
        self.updateval(start, stop, 1, x)
    
    def updateval(self, start, stop, a, b):
        """lazily add value to [start, stop)"""
        stop += 1
        start = start_copy = start + self._size
        stop = stop_copy = stop + self._size
        
        # Apply all the lazily stored queries
        self._update(start)
        self._update(stop - 1)
        
        while start < stop:
            if start & 1:
                self.data[start] = (a * self.data[start] + b) % 2
                self._lazy[2 * start], self._lazy[2 * start + 1] = func_lazy(a, b,
                                                                             self._lazy[2 * start],
                                                                             self._lazy[2 * start + 1])
                start += 1
            if stop & 1:
                stop -= 1
                self.data[stop] = (a * self.data[stop] + b) % 2
                self._lazy[stop * 2], self._lazy[2 * stop + 1] = func_lazy(a, b,
                                                                           self._lazy[2 * stop],
                                                                           self._lazy[2 * stop + 1])
            start >>= 1
            stop >>= 1
            b <<= 1
        
        self._build(start_copy)
        self._build(stop_copy - 1)
    
    def query(self, start, stop, res=0):
        stop += 1
        start += self._size
        stop += self._size
        
        # Apply all the lazily stored queries
        self._update(start)
        self._update(stop - 1)
        while start < stop:
            if start & 1:
                res += self.data[start]
                start += 1
            if stop & 1:
                stop -= 1
                res += self.data[stop]
            start >>= 1
            stop >>= 1
        return res
    
    def node_size(self, idx):
        return 1 << self._size.bit_length() - idx.bit_length()

def dfs(graph, alpha):
    """Depth First Search on a graph!"""
    n = len(graph)
    visited = [False] * n
    finished = [False] * n
    dp = [0] * n
    subtree = [0] * n
    order = []
    stack = [alpha]
    while stack:
        v = stack[-1]
        if not visited[v]:
            visited[v] = True
            for u in graph[v]:
                if not visited[u]:
                    stack.append(u)
        else:
            order += [stack.pop()]
            dp[v] = (switch[v] == 1)
            subtree[v] = 1
            for child in graph[v]:
                if finished[child]:
                    dp[v] += dp[child]
                    subtree[v] += subtree[child]
            
            finished[v] = True
    
    return dp, order[::-1], subtree

for _ in range(int(input()) if not True else 1):
    n = int(input())
    # n, k = map(int, input().split())
    # a, b = map(int, input().split())
    # c, d = map(int, input().split())
    a = list(map(int, input().split()))
    switch = [0] + list(map(int, input().split()))
    # s = input()
    graph = [[] for i in range(n + 1)]
    
    for i in range(len(a)):
        x, y = i + 2, a[i]
        graph[x] += [y]
        graph[y] += [x]
    
    dp, order, subtree = dfs(graph, 1)

    index = [0] * (n + 1)
    for i in range(len(order)):
        index[order[i]] = i + 1

    st = LazySegmentTree([0] * (n + 1), func=lambda a, b: a + b)
    for i in range(1, n + 1):
        if switch[index[i]]:
            st.updateval(i, i, 1, 1)

    for __ in range(int(input())):
        s = input().split()
        x = int(s[1])
        count = subtree[x]
        if s[0] == 'get':
            print(st.query(index[x], index[x] + count - 1))
        else:
            st.updateval(index[x], index[x] + count - 1, 1, 1)
        