#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
#include <time.h> 
using namespace atcoder;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvvb = vector<vvb>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)
template<class T>
bool chmax(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
template<class T>
bool chmin(T& p, T q, bool C = 1) {
    if (C == 0 && p == q) {
        return 1;
    }
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}
ll modPow(long long a, long long n, long long p) {
    if (n == 0) return 1; // 0乗にも対応する場合
    if (n == 1) return a % p;
    if (n % 2 == 1) return (a * modPow(a, n - 1, p)) % p;
    long long t = modPow(a, n / 2, p);
    return (t * t) % p;
}
ll gcd(ll(a), ll(b)) {
    if (a == 0)return b;
    if (b == 0)return a;
    ll c = a;
    while (a % b != 0) {
        c = a % b;
        a = b;
        b = c;
    }
    return b;
}
ll sqrtz(ll N) {
    ll L = 0;
    ll R = sqrt(N) + 10000;
    while (abs(R - L) > 1) {
        ll mid = (R + L) / 2;
        if (mid * mid <= N)L = mid;
        else R = mid;
    }
    return L;
}


using mint = modint998244353;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;


vector<mint> fact, factinv, inv;
const ll mod = 998244353;
void prenCkModp(ll n) {
    fact.resize(n + 5);
    factinv.resize(n + 5);
    inv.resize(n + 5);
    fact[0] = fact[1] = 1;
    factinv[0] = factinv[1] = 1;
    inv[1] = 1;
    for (ll i = 2; i < n + 5; i++) {
        fact[i] = (fact[i - 1] * i);
        inv[i] = (mod - ((inv[mod % i] * (mod / i))));
        factinv[i] = (factinv[i - 1] * inv[i]);
    }
}
mint nCk(ll n, ll k) {
    if (n < k || k < 0) return 0;
    return (fact[n] * ((factinv[k] * factinv[n - k])));
}


bool DEB = 1;


/*
base:桁数
insert(num): numを挿入. O(log(N))
erase(num): numがあれば一つ削除 O(log(N))
search(num): numがあるか判定 O(log(N))
small_num(num,x) d XOR num <x となる dの個数 O(log(N))
XOR_min(x): min(d XOR x) を求める

ToDo: 
insert_cnt(num,x): numをcnt個挿入
erase_all(num): numがあれば全て削除
XOR_max(x): min(d XOR x) を求める
All_xor(x): 全ての要素をXORする. 

全てO(logN)でできるはず. 
最後のは遅延評価的なのが必要でちょっと体力がいる
*/

struct Binary_Trie {
    ll base = 36;//桁数
    struct Node {
        vector<ll> next;
        vector<ll> accept;
        ll c;
        ll common;
        Node(ll c_) : c(c_), common(0) {
            next.assign(2, -1);
        }
    };

    vector<Node> nodes;
    ll root = 0;
    Binary_Trie() {
        nodes.push_back(Node(root));
    }

    void insert(const ll& num) {
        ll node_id = 0;
        for (ll b = base; b >= 0; b--) {
            ll nt = 0;
            nt = (num & (1ll << b) ? 1 : 0);

            if (nodes[node_id].next[nt] == -1) {
                nodes.push_back(Node(nt));
                nodes[node_id].next[nt] = nodes.size() - 1;
            }
            nodes[node_id].common++;
            node_id = nodes[node_id].next[nt];
        }
        nodes[node_id].common++;

    }

    bool search(const ll& num) {
        ll node_id = 0;
        bool EX = 1;
        for (ll b = base; b >= 0; b--) {
            ll nt = 0;
            nt = (num & (1ll << b) ? 1 : 0);

            if (nodes[node_id].next[nt] == -1||nodes[nodes[node_id].next[nt]].common==0) {
                EX = 0;
                break;
            }
            node_id = nodes[node_id].next[nt];
        }
        return EX;
    }

    void erase(const ll& num) {
        if (!search(num))return;
        ll node_id = 0;
        for (ll b = base; b >= 0; b--) {
            ll nt = 0;
            nt = (num & (1ll << b) ? 1 : 0);
            nodes[node_id].common--;
            node_id = nodes[node_id].next[nt];
        }
        nodes[node_id].common--;
    }

    ll small_num(const ll& p, const ll& x) {//d XOR p<x なるdの個数
        ll res = 0;
        ll node_id = 0;
        for (ll b = base; b >= 0; b--) {
            ll nx = 0, np = 0;
            nx = (x & (1ll << b) ? 1 : 0);
            np = (p & (1ll << b) ? 1 : 0);
            if (nx == 1) {
                if (nodes[node_id].next[np] != -1) {
                    res += nodes[nodes[node_id].next[np]].common;
                }
                if (nodes[node_id].next[1 - np] == -1) {
                    break;
                }
                else {
                    node_id = nodes[node_id].next[1 - np];
                    continue;
                }
            }
            else {
                if (nodes[node_id].next[np] == -1) {
                    break;
                }
                else {
                    node_id = nodes[node_id].next[np];
                    continue;
                }
            }
        }
        return res;
    }

    ll min_XOR(ll x){
        ll res=0;
        ll node_id = 0;
        for (ll b = base; b >= 0; b--) {
            ll nx = 0;
            nx = (x & (1ll << b) ? 1 : 0);
            if (nodes[node_id].next[nx] != -1&&nodes[nodes[node_id].next[nx]].common>0) {
                node_id=nodes[node_id].next[nx];
            }
            else {
                res+=(1ll<<b);
                node_id = nodes[node_id].next[1 - nx];
            }
        }
        return res;
    }


    ll K_thsmall(ll K){//K番目に小さい値を返す.(0index)
        if(nodes[0].common<=K)return -1e18;
        ll node_id=0;
        ll res=0;
        for (ll b = base; b >= 0; b--) {
            if(nodes[node_id].next[0]!=-1&&nodes[nodes[node_id].next[0]].common>K){
                node_id=nodes[node_id].next[0];
            }
            else{
                res+=(1ll<<b);
                if(nodes[node_id].next[0]!=-1){
                    K-=nodes[nodes[node_id].next[0]].common;
                }
                node_id=nodes[node_id].next[1];
            }
        }
        return res;
    }
};


void solve(){
    ll N;
    cin>>N;
    vb A(N);
    vector<string> Y(N-1);
    rep(i,N){
        string X;
        cin>>X;
        A[i]=(X[0]=='T');
    }
    rep(i,N-1)cin>>Y[i];
    Binary_Trie B,OP;
    rep(i,N)B.insert(i);
    rep(i,N-1)OP.insert(i);
    rep(i,N-1){
        ll S;
        cin>>S;
        ll L=B.K_thsmall(S-1);
        ll R=B.K_thsmall(S);
        ll G=OP.K_thsmall(S-1);
        B.erase(R);
        OP.erase(G);
        //cout<<L<<" "<<R<<" "<<G<<endl;
        if(Y[G]=="and"){
            A[L]=(A[L]&&A[R]);
        }
        else if(Y[G]=="or"){
            A[L]=(A[L]||A[R]);
        }
        else if(Y[G]=="xor"){
            A[L]=(A[L]^A[R]);
        }
        else{
            A[L]=((!A[L])||A[R]);
        }
        //cout<<A[L]<<endl;
    }
    ll an=B.K_thsmall(0);
    cout<<(A[an]?"True":"False")<<endl;
}

int main() {

    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll T;
    cin>>T;
    while(T--)solve();
}