using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    static string[] SList(long n) => Enumerable.Repeat(0, (int)n).Select(_ => ReadLine()).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new string[t];
        for (var u = 0; u < t; ++u)
        {
            var n = NN;
            var x = ReadLine().Split();
            var y = ReadLine().Split();
            var s = NList;
            ans[u] = IsTrue(n, x, y, s);
        }
        WriteLine(string.Join("\n", ans));
    }
    static string IsTrue(int n, string[] x, string[] y, int[] s)
    {
        var xl = new int[x.Length];
        for (var i = 0; i < xl.Length; ++i) xl[i] = x[i] == "False" ? 0 : 1;
        var yl = new int[y.Length];
        for (var i = 0; i < yl.Length; ++i) yl[i] = Decode(y[i]);
        var ft = new FenwickTree(n);
        for (var i = 0; i < n; ++i) ft.Add(i, 1);
        foreach (var si in s)
        {
            var pos0 = ft.LowerBound(si);
            var pos1 = ft.LowerBound(si + 1);
            xl[pos1] = Calc(xl[pos0], xl[pos1], yl[pos0]);
            ft.Add(pos0, -1);
        }
        return xl[ft.LowerBound(1)] == 0 ? "False" : "True";
    }
    static int Decode(string s)
    {
        switch (s)
        {
            case "and": return 0;
            case "or" : return 1;
            case "xor": return 2;
            default: return 3;
        }
    }
    static int Calc(int a, int b, int op)
    {
        switch (op)
        {
            case 0: return a & b;
            case 1: return a | b;
            case 2: return a ^ b;
            default: return 1 - a | b;
        }
    }
    class FenwickTree
    {
        int size;
        long[] tree;
        public FenwickTree(int size)
        {
            this.size = size;
            tree = new long[size + 2];
        }
        public void Add(int index, int value)
        {
            ++index;
            for (var x = index; x <= size; x += (x & -x)) tree[x] += value;
        }
        /// <summary>先頭からindexまでの和(include index)</summary>
        public long Sum(int index)
        {
            ++index;
            var sum = 0L;
            for (var x = index; x > 0; x -= (x & -x)) sum += tree[x];
            return sum;
        }
        /// <summary>Sum(x) >= value となる最小のxを求める</summary>
        // 各要素は非負であること
        public int LowerBound(long value)
        {
            if (value < 0) return -1;
            var x = 0;
            var b = 1;
            while (b * 2 <= size) b <<= 1;
            for (var k = b; k > 0; k >>= 1)
            {
                if (x + k <= size && tree[x + k] < value)
                {
                    value -= tree[x + k];
                    x += k;
                }
            }
            return x;
        }
    }
}