#include <stdio.h>
#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <array>
#include <queue>
#include <stack>
#include <set>
#include <list>
#include <limits>
#include <unordered_map>
#include <unordered_set>
#include <bitset>

#include <cmath>
#include <math.h>
#include <climits>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPI(i, init, n) for (ll i = init; i < (n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;

using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

using namespace std;

ll op(ll a, ll b) { return a + b; }
ll e() { return 0; }
using st = segtree<ll, op, e>;

vector<bool> x;

bool dfs(ll l, ll r, const vl& op, const vl& opo) {
    if (l == r) return x[l];

    ll cop = opo[0];
    vl opl, opr;
    REPI(i, 1, opo.size()) {
        if (opo[i] < cop) opl.push_back(opo[i]);
		else opr.push_back(opo[i]);
    }

    bool resl = dfs(l, cop, op, opl);
    bool resr = dfs(cop+1, r, op, opr);

    if (op[cop] == 0) return resl && resr;
    if (op[cop] == 1) return resl || resr;
    if (op[cop] == 2) return resl ^ resr;
    if (op[cop] == 3) return !resl || resr;
    return false;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll t;
    cin >> t;
    REP(ttt, t) {
        ll n;

        cin >> n;

        x.assign(n, false);
        REP(i, n) {
            string s;
            cin >> s;
            x[i] = s == "True";
        }

        vl y(n-1);
        REP(i, n-1) {
            string s;
            cin >> s;
            if (s == "and") y[i] = 0;
            if (s == "or") y[i] = 1;
            if (s == "xor") y[i] = 2;
            if (s == "imp") y[i] = 3;
        }

        vl seginit(n - 1, 1);
        st seg(seginit);

        VLI(s, n - 1);
        vl ns(n-1, -1);
        REP(i, n - 1) {
            ll si = s[i];
            ns[i] = seg.max_right(0, [si](const ll& sum) {return sum < si; });
            seg.set(ns[i], 0);
        }

        myrev(ns);

        bool res = dfs(0, n-1, y, ns);
        if (res) {
            cout << "True" << endl;
        }
        else {
 			cout << "False" << endl;
        }
 
    }

    return 0;
}