# a_k の値を x に更新
def update(k, x):
    k += N0 - 1
    data[k] = x  # 加算にするなら+=に
    while k >= 0:
        k = (k - 1) // 2
        data[k] = data[2 * k + 1] + data[2 * k + 2]

# 区間[l, r)の区間和
def query(l, r):
    s = 0
    L = l + N0;
    R = r + N0
    while L < R:
        if R & 1:
            R -= 1
            s += data[R - 1]
        if L & 1:
            s += data[L - 1]
            L += 1
        L >>= 1;
        R >>= 1
    return s

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

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()))

    # N: セグ木処理する区間の長さ
    N0 = 2 ** (N + 1).bit_length()
    data = [0] * (2 * N0)
    for i in range(N):
        update(i, 1)
    for s in S:
        r = search(s)
        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
        update(l, 0)
    print(X[r])