#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(ll i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for(ll i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for(ll i = (n) - 1; i >= 0; i--)
#define rreps(i, e, n) for(ll i = (n) - 1; i >= (e); i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) ((ll)(x).size())
#define len(x) ((ll)(x).length())
#define endl "\n"
template<class T> void chmax(T &a, const T b){ a = max(a, b); }
template<class T> void chmin(T &a, const T b){ a = min(a, b); }
long long gcd(long long a, long long b) { return (a % b) ? gcd(b, a % b) : b; }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }

ll gi(string s) {
    string res[] = {"*", "WA", "TLE", "MLE", "OLE", "RE"};
    rep(i, 6) {
        if (res[i] == s) {
            return i;
        }
    }
    return 0;
}

void solve() {
    vector<ll> before(6), after(6);
    rep(i, 6) cin >> before[i];
    rep(i, 6) cin >> after[i];
    string s;
    cin >> s;
    ll idx = gi(s);
    if (before[idx] != 0) {
        cout << "No" << endl;
        return;
    }
    ll num = 0;
    rep(i, 6) {
        if ((i == 0) || (i == idx)) continue;
        if (after[i] != 0) {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    // ifstream in("input.txt");
    // cin.rdbuf(in.rdbuf());
    ll t;
    cin >> t;
    rep(i, t) solve();
    return 0;
}