from collections import defaultdict

class UnionFind():
    def __init__(self, n):
        '''
        UnionFindクラス。nは要素数を表す。
        '''
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        '''
        要素xを含む集合の親を見つける関数。
        '''
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        '''
        要素xを含む集合と要素yを含む集合を合体する関数。
        基本的には、要素数が多い集合に統合される。
        要素数が同じときは要素yを含む集合に統合される。
        '''
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        '''
        要素xを含む集合の要素数を出す関数。
        '''
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members

    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())

for _ in range(int(input())):
    n = int(input())
    P = list(input().split())
    OP = list(input().split())
    X = list(map(int, input().split()))
    R = [i for i in range(n)]
    UF = UnionFind(n)
    for i in range(n - 1):
        idx = X[i] - 1
        ri = UF.find(idx)
        i = R[ri]
        op = OP[i]
        rj = UF.find(i + 1)
        j = R[rj]
        s, t = P[i], P[j]
        if op == 'and':
            if s == 'True' and t == 'True':
                res = 'True'
            else:
                res = 'False'
        elif op == 'or':
            if s == 'True' or t == 'True':
                res = 'True'
            else:
                res = 'False'
        elif op == 'xor':
            if s != t:
                res = 'True'
            else:
                res = 'False'
        elif op == 'imp':
            if s == 'True':
                res = t
            else:
                res = 'True'
        UF.union(ri, rj)
        r = UF.find(ri)
        R[r] = max(i, j)
        P[R[r]] = res
    r = UF.find(0)
    print(P[R[r]])