#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>
#include <atcoder/segtree>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

int op(int x, int y){
    return x+y;
}

int e(){
    return 0;
}

using P = pair<int, bool>;
using Seg = atcoder::segtree<int, op, e>;

void solve(){
    int n; cin >> n;
    vector<bool> x(n);
    set<P> st;
    for(int i = 0; i < n; i++){
        string s; cin >> s;
        x[i] = s[0] == 'T';
        st.insert({i, x[i]});
    }
    Seg seg(vector<int>(n-1, 1));
    vector<string> y(n-1);
    vector<int> s(n-1);
    for(int i = 0; i < n-1; i++) cin >> y[i];
    for(int i = 0; i < n-1; i++) {
        cin >> s[i];
    }
    for(int i = 0; i < n-1; i++){
        auto g = [&](int x){
            return x < s[i];
        };
        int c = seg.max_right(0, g);
        bool ans = false;
        auto p = st.upper_bound({c, true});
        assert(p != st.end());
        auto [ir, fr] = *p;
        auto [il, fl] = *prev(p);
        assert(il <= c);
        assert(ir == c+1);
        assert(seg.prod(0, c+1) == s[i]);
        st.erase({ir, fr});
        st.erase({il, fl});
        if(y[i] == "and"){
            ans = (fl&&fr); 
        }else if(y[i] == "or"){
            ans = (fl||fr); 
        }else if(y[i] == "xor"){
            ans = (fl!=fr); 
        }else{
            if(fl) ans = fr;
            ans = true;
        }
        st.insert({il, ans});
        seg.set(c, 0);
        // for(auto [i, f]: st) cout << f << ' ';
        // cout << endl;
    }
    assert(st.begin()->first == 0);
    if(st.begin()->second){
        cout << "True\n";
    }else{
        cout << "False\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int t; cin >> t;
    while(t--) solve();
}