#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int op(int a, int b){return a+b;}
int e(){return 0;}

bool calc(bool a, string x, bool b){
  if(x=="and") return a&b;
  else if(x=="or") return a|b;
  else if(x=="xor") return a^b;
  else return a?b:true;
} 

void solve(){
  int N; cin >> N;
  vector<bool> X(N);
  vector<string> o(N-1);
  rep(i,N){
    string s; cin >> s;
    X[i]=(s=="True");
  }
  rep(i,N-1){
    cin >> o[i];
  }
  atcoder::segtree<int,op,e> seg(N);
  rep(i,N) seg.set(i,1);
  rep(i,N-1){
    int p; cin >> p; p--;
    int pj,pk;
    int ok = 0, ng = N;
    while(abs(ok-ng)>1){
      int mid = (ok+ng)/2;
      if(seg.prod(0,mid)<=p) ok = mid;
      else ng = mid;
    }
    pj = ok;
    ok = 0, ng = N;
    while(abs(ok-ng)>1){
      int mid = (ok+ng)/2;
      if(seg.prod(0,mid)<=p+1) ok = mid;
      else ng = mid;
    }
    pk = ok;
    X[pj] = calc(X[pj],o[pj],X[pk]);
    seg.set(pk,0);
  }
  cout << (X[0]?"True":"False") << '\n';
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int T; cin >> T;
  while(T--) solve();
  return 0;
}