import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int t = Integer.parseInt(br.readLine());
		PrintWriter pw = new PrintWriter(System.out);
		for (int z = 0; z < t; z++) {
			int n = Integer.parseInt(br.readLine());
			Obj[] arr = new Obj[n];
			String[] sa = br.readLine().split(" ");
			for (int i = 0; i < n; i++) {
				Obj o = new Obj();
				o.i = i;
				o.r = i + 1;
				if (sa[i].equals("True")) {
					o.val = true;
				}
				arr[i] = o;
			}
			sa = br.readLine().split(" ");
			for (int i = 0; i < n - 1; i++) {
				arr[i].y = sa[i];
			}
			sa = br.readLine().split(" ");
			int[] s = new int[n - 1];
			for (int i = 0; i < n - 1; i++) {
				s[i] = Integer.parseInt(sa[i]) - 1;
			}

			FenwickTree ft = new FenwickTree(n);
			for (int i = 0; i < n - 1; i++) {
				int ok = s[i];
				int ng = n;
				while (Math.abs(ok - ng) > 1) {
					int mid = (ok + ng) / 2;
					int idx = (int) (mid - ft.sum(mid + 1));
					if (idx <= s[i]) {
						ok = mid;
					} else {
						ng = mid;
					}
				}
				Obj o1 = arr[ok];
				Obj o2 = arr[o1.r];
				if (o1.y.equals("and")) {
					o1.val = o1.val && o2.val;
				} else if (o1.y.equals("or")) {
					o1.val = o1.val || o2.val;
				} else if (o1.y.equals("xor")) {
					o1.val = o1.val ^ o2.val;
				} else {
					if (o1.val) {
						o1.val = o2.val;
					} else {
						o1.val = true;
					}
				}
				o1.r = o2.r;
				ft.add(o2.i, 1);
			}
			pw.println(arr[0].val ? "True" : "False");
		}
		pw.flush();
		br.close();
	}

	static class Obj {
		int i, r;
		boolean val;
		String y;
	}
}

class FenwickTree {
	private int n;
	private long[] data;

	/**
	 * 長さnの配列（a[0]～a[n-1]）を作る。初期値は全て0。<br>
	 * O(n)
	 * 
	 * @param n 配列の長さ
	 */
	public FenwickTree(int n) {
		this.n = n;
		data = new long[n];
	}

	/**
	 * 初期データを元にFenwick Treeを構成する。<br>
	 * O(n)
	 * 
	 * @param data 初期データ
	 */
	public FenwickTree(long[] data) {
		this(data.length);
		build(data);
	}

	/**
	 * a[p] += x を行う。<br>
	 * O(log n)
	 * 
	 * @param p 加算位置（0≦p＜n）
	 * @param x 加算値
	 */
	void add(int p, long x) {
		assert 0 <= p && p < n : "p=" + p;

		p++;
		while (p <= n) {
			data[p - 1] += x;
			p += p & -p;
		}
	}

	/**
	 * a[l] + ... + a[r-1] を返す。<br>
	 * O(log n)
	 * 
	 * @param l 開始位置（含む）    （0≦l≦r≦n）
	 * @param r 終了位置（含まない）（0≦l≦r≦n）
	 */
	long sum(int l, int r) {
		assert 0 <= l && l <= r && r <= n : "l=" + l + ", r=" + r;

		return sum(r) - sum(l);
	}

	/**
	 * a[0] + ... + a[r-1] を返す。<br>
	 * O(log n)
	 * 
	 * @param r 終了位置（含まない）（0≦r≦n）
	 */
	long sum(int r) {
		assert 0 <= r && r <= n : "r=" + r;

		long s = 0;
		while (r > 0) {
			s += data[r - 1];
			r -= r & -r;
		}
		return s;
	}

	private void build(long[] dat) {
		System.arraycopy(dat, 0, data, 0, n);
		for (int i = 1; i <= n; i++) {
			int p = i + (i & -i);
			if (p <= n) {
				data[p - 1] += data[i - 1];
			}
		}
	}
}