//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
//#pragma GCC optimize("Ofast,fast-math")
//#pragma GCC target("avx,avx2")
//#pragma GCC optimize(2)
//#pragma GCC optimize(3)
//#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include<bits/extc++.h>
using namespace std;
//#define int long long
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef double db;
#define F(i, a, b) for(int i = a; i <= (b); ++i)
#define F2(i, a, b) for(int i = a; i < (b); ++i)
#define dF(i, a, b) for(int i = a; i >= (b); --i)
template<typename T> void debug(string s, T x) {
	cerr << "[" << s << "] = [" << x << "]\n";
}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {
	for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;
	else if (s[i] == ')' || s[i] == '}') b--;
	else if (s[i] == ',' && b == 0) {
		cerr << "[" << s.substr(0, i) << "] = [" << x << "] | ";
		debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);
		break;
	}
}
#ifdef ONLINE_JUDGE
#define Debug(...)
#else
#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif
#define pb push_back
#define fi first
#define se second
#define Mry fprintf(stderr, "%.3lf MB\n", (&Med - &Mbe) / 1048576.0)
#define Try cerr << 1e3 * clock() / CLOCKS_PER_SEC << " ms\n";
typedef long long ll;
// namespace Fread {const int SIZE = 1 << 17; char buf[SIZE], *S, *T; inline char getchar() {if (S == T) {T = (S = buf) + fread(buf, 1, SIZE, stdin); if (S == T) return '\n';} return *S++;}}
// namespace Fwrite {const int SIZE = 1 << 17; char buf[SIZE], *S = buf, *T = buf + SIZE; inline void flush() {fwrite(buf, 1, S - buf, stdout), S = buf;} inline void putchar(char c) {*S++ = c;if (S == T) flush();} struct NTR {~NTR() {flush();}} ztr;}
// #ifdef ONLINE_JUDGE
// #define getchar Fread::getchar
// #define putchar Fwrite::putchar
// #endif
inline int ri() {
	int x = 0;
	bool t = 0;
	char c = getchar();
	while (c < '0' || c > '9') t |= c == '-', c = getchar();
	while (c >= '0' && c <= '9') x = (x << 3) + (x << 1) + (c ^ 48), c = getchar();
	return t ? -x : x;
}
inline void wi(int x) {
	if (x < 0) {
		putchar('-'), x = -x;
	}
	if (x > 9) wi(x / 10);
	putchar(x % 10 + 48);
}
inline void wi(int x, char s) {
	wi(x), putchar(s);
}
bool Mbe;
// mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll infll = 0x3f3f3f3f3f3f3f3f;
const int _ = 2e5 + 5;


int n;

char str[5];

struct Hash {
	const size_t operator()(pair<vi, int> a) const {
		unsigned long long res = 0;
		F(i, 0, 4) res = res * 19491001ull + a.fi[i];
		res = res * 19491001ull + a.se;
		return res;
	}
};
__gnu_pbds::gp_hash_table<pair<vi, int>, int, Hash> mp;

int dfs(vi a, int nw) {
//	Debug(nw);
	if(mp.find(make_pair(a, nw)) != mp.end()) return mp[make_pair(a, nw)];
	if(!nw) {
		bool flg = 1;
		F(i, 1, 4) flg &= (a[i - 1] + a[4] < 5);
		if(flg) return 0;
	}
	int res = 0;
	if(!nw) {
		F(i, 1, 4) if(a[i - 1] + a[4] >= 5) {
			if(a[i - 1] >= 5) {
				vi b = a;
				b[i - 1] -= 5;
				res = max(res, dfs(b, nw) + 1);
			} else {
				vi b = a;
				int need = 5 - a[i - 1];
				b[i - 1] = 0, b[4] -= need;
				res = max(res, dfs(b, nw) + 1);
			}
		}
		return mp[make_pair(a, nw)] = res;
	}
	bool fg = 1;
	F(i, 2, 5) fg &= ((nw >> i & 1) == 0);
	if(fg) {
		if(nw & 1) { // 死神
			F(i, 0, 3) if(a[i]) {
				if(a[4]) {
					vi b = a;
					b[4]++;
					b[i]--;
					res = max(res, dfs(b, nw ^ 1));
				} else {
					F(j, 0, 3) if(j != i && a[j]) {
						vi b = a;
						b[j]++;
						b[i]--;
						res = max(res, dfs(b, nw ^ 1));
					}
				}
			}
			res = max(res, dfs(a, nw ^ 1));
		}
		if(nw >> 1 & 1) { // 粘人
			F(i, 0, 3) if(a[i]) {
				vi b = a;
				b[i]--;
				b[4]++;
				res = max(res, dfs(b, nw ^ 2));
			}
			res = max(res, dfs(a, nw ^ 2));
		}
	}
	if(nw >> 2 & 1) {
		F(i, 0, 3) if(i != 3 && a[i]) {
			a[i]--;
			F(j, i, 3) if(j != 3 && a[j]) {
				a[j]--;
				F(k, j, 3) if(k != 3 && a[k]) {
					a[k]--;
					vi d = a;
					d[3] += 3;
					res = max(res, dfs(d, nw ^ 4));
					a[k]++;
				}
				vi d = a;
				d[3] += 2;
				res = max(res, dfs(d, nw ^ 4));
				a[j]++;
			}
			vi d = a;
			d[3] += 1;
			res = max(res, dfs(d, nw ^ 4));
			a[i]++;
		}
		res = max(res, dfs(a, nw ^ 4));
	}
	if(nw >> 3 & 1) {
		F(i, 0, 3) if(i != 2 && a[i]) {
			a[i]--;
			F(j, i, 3) if(j != 2 && a[j]) {
				a[j]--;
				F(k, j, 3) if(k != 2 && a[k]) {
					a[k]--;
					vi d = a;
					d[2] += 3;
					res = max(res, dfs(d, nw ^ 8));
					a[k]++;
				}
				vi d = a;
				d[2] += 2;
				res = max(res, dfs(d, nw ^ 8));
				a[j]++;
			}
			vi d = a;
			d[2] += 1;
			res = max(res, dfs(d, nw ^ 8));
			a[i]++;
		}
		res = max(res, dfs(a, nw ^ 8));
	} 
	if(nw >> 4 & 1) {
		F(i, 0, 3) if(i != 1 && a[i]) {
			a[i]--;
			F(j, i, 3) if(j != 1 && a[j]) {
				a[j]--;
				F(k, j, 3) if(k != 1 && a[k]) {
					a[k]--;
					vi d = a;
					d[1] += 3;
					res = max(res, dfs(d, nw ^ 16));
					a[k]++;
				}
				vi d = a;
				d[1] += 2;
				res = max(res, dfs(d, nw ^ 16));
				a[j]++;
			}
			vi d = a;
			d[1] += 1;
			res = max(res, dfs(d, nw ^ 16));
			a[i]++;
		}
		res = max(res, dfs(a, nw ^ 16));
	}
	if(nw >> 5 & 1) {
		F(i, 0, 3) if(i != 0 && a[i]) {
			a[i]--;
			F(j, i, 3) if(j != 0 && a[j]) {
				a[j]--;
				F(k, j, 3) if(k != 0 && a[k]) {
					a[k]--;
					vi d = a;
					d[0] += 3;
					res = max(res, dfs(d, nw ^ 32));
					a[k]++;
				}
				vi d = a;
				d[0] += 2;
				res = max(res, dfs(d, nw ^ 32));
				a[j]++;
			}
			vi d = a;
			d[0] += 1;
			res = max(res, dfs(d, nw ^ 32));
			a[i]++;
		}
		res = max(res, dfs(a, nw ^ 32));
	}
//	if(mp.size() % 5000 == 0) Debug(mp.size());
	return mp[make_pair(a, nw)] = res;
}

bool Med;
signed main() {
	// Mry;
	int T = ri();
	while(T--) {
		n = ri();
		vi a(5, 0);
		F(i,0, n - 1) {
			scanf("%s", str + 1);
			if(str[2] == 'D') {
				a[0]++;
			} else if(str[2] == 'C') {
				a[1]++;
			} else if(str[2] == 'H') {
				a[2]++;
			} else {
				a[3]++;
			}
		}
		int nw = 0;
		F(i, 1, 6) {
			nw = nw * 2 + ri();
		}
		cout << dfs(a, nw) <<'\n';
	}
	// Try;
	return 0;
}

/*
4
5
2H 3H 4H 5H 6D
1 1 1 1 0 0
5
2S 3S 4D 5C 6D
0 0 1 0 1 1
5
2S 3S 4D 5C 6D
0 0 1 0 1 0
13
AS 2S 3S 4S 5H 6H 7H 8H 9H TH JH QH KH
0 0 0 0 0 1
*/