#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);
template <typename T>
struct BIT{
    int n;
    vector<T> data;
    BIT(int n=0) : n(n), data(n+1){}
    T sum(int i){
        T res = 0;
        for(; i; i -= i&-i){
            res += data[i];
        }
        return res;
    }
    void add(int i, T x){
        for(; i <= n; i += i&-i){
            data[i] += x;
        }
    }
    // 非減少である時のみ可
    int lower_bound(T w){
        int x = 0, r = 1;
        while(r < n) r <<= 1;
        for(int len = r; len > 0; len = len >> 1){
            if(x+len < n && data[x+len] < w){
                w -= data[x+len];
                x += len;
            }
        }
        return x+1;
    }
};
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    string x = "aoxi";
    rep(houren,t){
        int n;
        cin >> n;
        vector<int> a(n), b(n-1);
        BIT<int> bit(n);
        rep(i,n) bit.add(i+1,1);
        string s;
        rep(i,n){
            cin >> s;
            a[i] = (s[0]=='T');
        }
        rep(i,n-1){
            cin >> s;
            rep(j,4) if(s[0]==x[j]) b[i] = j;
        }
        rep(i,n-1){
            int p;
            cin >> p;
            int q = bit.lower_bound(p), r = bit.lower_bound(p+1);
            bit.add(q,-1);
            q--; r--;
            if(b[q]==0) a[r] &= a[q];
            if(b[q]==1) a[r] |= a[q];
            if(b[q]==2) a[r] ^= a[q];
            if(b[q]==3) a[r] = min(1, !a[q]+a[r]);
        }
        cout << (a[n-1]?"True\n":"False\n");
    }
    return 0;
}