#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N;
	cin >> N;
	map<string, int> mm;
	vector<string> strs = {"AC", "WA", "TLE", "MLE", "OLE", "RE"};
	REP(i, strs.size()) mm[strs[i]] = i;
	
	while (N--) {
		puts([&]() -> bool {
			int bef[6], aft[6];
			REP(i, 6) scanf("%d", bef + i);
			REP(i, 6) scanf("%d", aft + i);
			string X;
			cin >> X;
			int res = mm[X];
			if (bef[res] > 0) return false;
			int sum = accumulate(ALL(bef), 0);
			if (aft[0] + aft[res] == sum) return true;
			return false;
		}() ? "Yes": "No");
	}
}