class Bit:
    def __init__(self, n):
        self.size = n
        self.tree = [0] * (n + 1)

    def sum(self, i):
        s = 0
        while i > 0:
            s += self.tree[i]
            i -= i & -i
        return s

    def add(self, i, x):
        while i <= self.size:
            self.tree[i] += x
            i += i & -i

def search(x):
    lb = 0
    ub = N
    while ub - lb > 1:
        mid = (lb + ub) // 2
        if bit.sum(mid) <= x - 1:
            lb = mid
        else:
            ub = mid
    return lb + 1

T = int(input())
for t in range(T):
    N = int(input())
    X = [True if x == "True" else False for x in input().split()]
    Y = input().split()
    S = list(map(int, input().split()))
    bit = Bit(N + 1)
    B = [1] * (N + 1)
    for i in range(1, N + 1):
        bit.add(i, 1)

    for s in S:
        r = search(s+1) - 1
        l = search(s) - 1
        if Y[l] == "and":
            X[r] &= X[l]
        elif Y[l] == "or":
            X[r] |= X[l]
        elif Y[l] == "xor":
            X[r] ^= X[l]
        else:
            if X[l] == False:
                X[r] = True
        bit.add(l + 1, -1)
        B[l + 1] -= 1
    print(X[r])