#include <bits/stdc++.h>

using namespace std;

#define forn(i, n) for (int i = 0; i < int(n); ++i)
#define fore(i, l, r) for (int i = int(l); i < int(r); ++i)
#define sz(a) ((int)((a).size()))
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define all(a) (a).begin(), (a).end()

typedef pair<int, int> ptt;
typedef long long li;
typedef long double ld;

const li INF64 = (li)(1e18);
const int INF = (int)(1e9);

struct state
{
	vector<int> cards, arcana;
	state() {};
	state(vector<int> c, vector<int> a) : cards(c), arcana(a) {};
};

bool operator<(const state& a, const state& b)
{
	if(a.cards != b.cards) return a.cards < b.cards;
	return a.arcana < b.arcana;
}

int norm(int x)
{
	while(x >= 5) x -= 5;
	while(x < 0) x += 5;
	return x;
}

state fix(const state& s)
{
	vector<int> c2 = s.cards;
	for(auto& x : c2) x = norm(x);
	return state(c2, s.arcana);
}

unordered_map<int, int> dp;

int cnt(state s)
{
	int ans = 0;
	for(auto x : s.cards) ans += x;
	return ans;
}

ostream& operator<<(ostream& out, const state& s)
{
	out << "[";
	forn(i, 4) out << s.cards[i];
	out << "][";
	forn(i, 4) out << s.arcana[i];
	return out << "]";
}

int code(const state& s)
{
	int ans = 0;
	for(auto x : s.cards) ans = (ans * 6) + x;
	for(auto x : s.arcana) ans = (ans * 6) + x;
	return ans;
}

int calc(const state& s)
{
	int cc = code(s);
	if(dp.count(cc)) return dp[cc];
	int& d = dp[cc];
	d = cnt(s);
	for(int i = 0; i < 4; i++)
	{
		if(s.arcana[i] == 0) continue;
		for(int j = 0; j < 4; j++)
		{
			if(i == j) continue;
			auto cd = s.cards;
			auto ar = s.arcana;
			ar[i]--;
			cd[i]++;
			cd[j]--;
			d = min(d, calc(fix(state(cd, ar))));
		}
	}
	return d;
}

int cds[4];
int ar[6];
int n;

bool read()
{
//	dp.clear();
	cin >> n;
	string s;
	forn(i, 4) cds[i] = 0;
	forn(i, n)
	{
		cin >> s;
		int idx = string("DCHS").find(s[1]);
		cds[idx]++;
	}
	forn(i, 6) cin >> ar[i];
	forn(i, 4) ar[i] *= 3;
	return true;
}

void solve()
{
	int ans = INF;
	forn(i, 4) forn(j, 4)
	{
		vector<int> cards(cds, cds + 4);
		vector<int> arcana(ar, ar + 4);
		if(ar[4] == 1) arcana[i]++;
		if(ar[5] == 1) arcana[j]++;
		ans = min(ans, calc(fix(state(cards, arcana))));
		//cout << state(cards, arcana) << " " << calc(state(cards, arcana)) << endl;
	}
	/*for(auto x : dp)
	{
		cout << x.first << " " << x.second << endl;
	}*/
	cout << (n - ans) / 5 << endl;
}

int main(){
#ifdef _DEBUG
	freopen("input.txt", "r", stdin);
#endif
	cin.tie(0);
	ios::sync_with_stdio(false);
	int tc = 1;
	cin >> tc;
	while(tc > 0)
	{
		--tc;
		read();
		solve();
	}
}