#include<bits/stdc++.h>
// #define int long long
#define eb emplace_back
#define mp make_pair
// #define DEBUG
using namespace std;
using pii = pair<int, int>;
using piii = pair<int, pii>;
using piiii = pair<pii, pii>;
using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned int;
const int P = 998244353;const i64 inf = 0x3f3f3f3f3f3f3f3f;
namespace azus{
	int clear();
	int n;
	int cnt[5];
	int ans, mx;
	int cr[7];
	vector<vector<int> > ct;
	int getpre(){
		ct.clear();
		for(int i = 0; i <= 3; i ++){
			for(int j = 0; j <= 3; j ++){
				for(int k = 0; k <= 3; k ++){
					for(int l = 0; l <= 3; l ++){
						if(i + j + k + l != 3) continue;
						vector<int> s;
						s.eb(0);
						s.eb(i); s.eb(j); s.eb(k); s.eb(l);
						ct.eb(s);
						// cout << i << " " << j << " " << k << " " << l  << "\n";
					}
				}
			}
		}
		return 0;
	}
	int solve(int nw){
		if(cr[5]){
			for(int i = 1; i <= 4; i ++){
				for(int j = 1; j <= 4; j ++){
					if(i != j){
						if(cnt[i]){
							cnt[i] --, cnt[j] ++;
							cr[5] = 0;
							bool cflg = 0;
							if(cnt[j] >= 5){
								cflg = 1;
								cnt[j] -= 5;
							}
							solve(nw + cflg);
							if(cflg){
								cnt[j] += 5;
							}
							cr[5] = 1;
							cnt[i] ++, cnt[j] --;
						}
					}
				}
			}
			cr[5] = 0;
			solve(nw);
			cr[5] = 1;
			return 0;
		}
		if(cr[6]){
			for(int i = 1; i <= 4; i ++){
				for(int j = 1; j <= 4; j ++){
					if(i != j){
						if(cnt[i] && cnt[j]){
							cnt[i] --, cnt[j] ++;
							cr[6] = 0;
							bool cflg = 0;
							if(cnt[j] >= 5){
								cflg = 1;
								cnt[j] -= 5;
							}
							solve(nw + cflg);
							if(cflg){
								cnt[j] += 5;
							}
							cr[6] = 1;
							cnt[i] ++, cnt[j] --;
						}
					}
				}
			}
			cr[6] = 0;
			solve(nw);
			cr[6] = 1;
			return 0;
		}
		for(int c = 1; c <= 4; c ++){
			if(!cr[c]) continue;
			bool cf = 0;
			for(int k = 0; k < (int)ct.size(); k ++){
				int flg = 1;
				for(int i = 1; i <= 4; i ++){
					if(cnt[i] < ct[k][i])
						flg = 0;
				}
				if(!flg) continue;
				for(int i = 1; i <= 4; i ++){
					cnt[i] -= ct[k][i];
				}
				cnt[c] += 3;
				cr[c] = 0;
				int cqr = 0;
				while(cnt[c] >= 5) cqr ++, cnt[c] -= 5;
				cf = 1;
				solve(nw + cqr);
				while(cqr --) cnt[c] += 5;
				cr[c] = 1;
				cnt[c] -= 3;
				for(int i = 1; i <= 4; i ++){
					cnt[i] += ct[k][i];
				}
			}
			cr[c] = 0;
			solve(nw);
			cr[c] = 1;
			return 0;
		}
		vector<int> ccnt(5, 0);
		for(int i = 1; i <= 4; i ++) ccnt[i] = cnt[i];
		int tmp = 0;
		for(int i = 1; i <= 4; i ++){
			while(ccnt[i] >= 5) ccnt[i] -= 5, tmp ++;
		}
		mx = max(mx, tmp + nw);
		return 0;
	}
	int main(){
		clear();
		cin >> n;
		for(int i = 1; i <= n; i ++){
			string s; cin >> s;
			if(s[1] == 'D') cnt[1] ++;
			if(s[1] == 'C') cnt[2] ++;
			if(s[1] == 'H') cnt[3] ++;
			if(s[1] == 'S') cnt[4] ++;
		}
		for(int i = 1; i <= 6; i ++) cin >> cr[i];
		for(int i = 1; i <= 4; i ++){
			while(cnt[i] >= 5) cnt[i] -= 5, ans ++;
		}
		solve(ans);
		cout << mx << "\n";
		return 0;
	}
	int clear(){
		cnt[1] = 0, cnt[2] = 0, cnt[3] = 0, cnt[4] = 0;
		ans = 0, mx = 0;
		getpre();
		return 0;
	}
}
signed main(){
#ifndef DEBUG
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
#endif
	int T = 1;
	cin >> T;
	while(T --)
		azus::main();
	return 0;
}