#line 1 "B.cpp"
// #pragma GCC target("avx2,avx512f,avx512vl,avx512bw,avx512dq,avx512cd,avx512vbmi,avx512vbmi2,avx512vpopcntdq,avx512bitalg,bmi,bmi2,lzcnt,popcnt")
// #pragma GCC optimize("Ofast")

#line 2 "/home/sigma/comp/library/template.hpp"

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
using ull = unsigned long long;
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rep1(i,n) for(int i=1;i<=int(n);i++)
#define per(i,n) for(int i=int(n)-1;i>=0;i--)
#define per1(i,n) for(int i=int(n);i>0;i--)
#define all(c) c.begin(),c.end()
#define si(x) int(x.size())
#define pb push_back
#define eb emplace_back
#define fs first
#define sc second
template<class T> using V = vector<T>;
template<class T> using VV = vector<vector<T>>;
template<class T,class U> bool chmax(T& x, U y){
	if(x<y){ x=y; return true; }
	return false;
}
template<class T,class U> bool chmin(T& x, U y){
	if(y<x){ x=y; return true; }
	return false;
}
template<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}
template<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}
template<class T>
V<T> Vec(size_t a) {
    return V<T>(a);
}
template<class T, class... Ts>
auto Vec(size_t a, Ts... ts) {
  return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));
}
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){
	return o<<"("<<p.fs<<","<<p.sc<<")";
}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){
	o<<"{";
	for(const T& v:vc) o<<v<<",";
	o<<"}";
	return o;
}
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }

#ifdef LOCAL
#define show(x) cerr << "LINE" << __LINE__ << " : " << #x << " = " << (x) << endl
void dmpr(ostream& os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ~ ";
	dmpr(os,args...);
}
#define shows(...) cerr << "LINE" << __LINE__ << " : ";dmpr(cerr,##__VA_ARGS__)
#define dump(x) cerr << "LINE" << __LINE__ << " : " << #x << " = {";  \
	for(auto v: x) cerr << v << ","; cerr << "}" << endl;
#else
#define show(x) void(0)
#define dump(x) void(0)
#define shows(...) void(0)
#endif

template<class D> D divFloor(D a, D b){
	return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}
template<class D> D divCeil(D a, D b) {
	return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}
#line 5 "B.cpp"

int solve(){
	V<int> ini(4);
	{
		int n; cin >> n;
		while(n--){
			string s; cin >> s;
			if(s[1] == 'D') ini[0]++;
			if(s[1] == 'C') ini[1]++;
			if(s[1] == 'H') ini[2]++;
			if(s[1] == 'S') ini[3]++;
		}
	}
	V<int> tarot(6); rep(i,6) cin >> tarot[i];

	set<V<int>> st; st.insert(ini);
	rep(ph,6) if(tarot[ph]){
		set<V<int>> nx = st;
		for(auto v: st){
			if(ph < 4){
				v[ph] += 3;
				rep(i,4) rep(j,4-i) rep(k,4-i-j){
					int l = 3-i-j-k;
					V<int> nv = v;
					nv[0] -= i; nv[1] -= j; nv[2] -= k; nv[3] -= l;
					rep(_,4) if(nv[_] < 0) goto FAIL;
					nx.insert(nv);
					FAIL:;
				}
				v[ph] -= 3;
			}else{
				rep(i,4) if(v[i]) rep(j,4){
					V<int> nv = v;
					nv[i]--; nv[j]++;
					nx.insert(nv);
				}
			}
		}
		st = nx;
		show(st.count({0,0,3,2}));
		show(st.count({0,0,4,1}));
		show(st.count({0,0,5,0}));
	}
	int ans = 0;
	for(auto v: st){
		int sum = 0;
		rep(i,4) sum += v[i]/5;
		chmax(ans,sum);
	}
	return ans;
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);		//DON'T USE scanf/printf/puts !!
	cout << fixed << setprecision(20);

	int T; cin >> T;
	while(T--) cout << solve() << endl;
}