#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
#define popcnt __builtin_popcountll
const int mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline int lg2(int x){ return 31^__builtin_clz(x); }
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }

bool dp[53][53][53][3][8];
int id[256];
int n, has[15]; char s[10];

int c[10], ans;

int seq[10];
void checkans(int a,int b,int c,int d,int e){
	seq[1]=a; seq[2]=b; seq[3]=c; seq[4]=d;
	int tmp = a/5+b/5+c/5+d/5;
	if(!e) {
		ans = max(ans, tmp);
	}else if(e==1){
		for(int i=1;i<=4;i++){
			ans = max(ans, tmp-seq[i]/5+(seq[i]+1)/5);
		}
	}else{
		int d1 = 0, d2 = 0;
		for(int i=1;i<=4;i++){
			ans = max(ans, tmp-seq[i]/5+(seq[i]+2)/5);
			int now = (seq[i]+1)/5-seq[i]/5;
			if(now > d1) swap(now, d1);
			if(now > d2) swap(now, d2);
		}
		ans = max(ans, tmp+d1+d2);
	}
}
void dfs(int a,int b,int c,int d,int x){
	if(dp[a][b][c][d][x]) return;
	dp[a][b][c][d][x]=1;
	// cout<<"visit "<<a<<" "<<b<<" "<<c<<" "<<n-a-b-c-d<<" "<<d<<" x="<<x<<endl;
	checkans(a,b,c,n-a-b-c-d,d);
	if(x > 6) return;
	dfs(a,b,c,d,x+1);
	if(!has[x]) return;

	seq[1]=a; seq[2]=b; seq[3]=c; seq[4]=n-a-b-c-d; seq[5]=d;
	if(x <= 4){
		for(int i=1;i<=4;i++){ if(i==x || !seq[i]) continue;
			seq[i]--; seq[x] ++;
			dfs(seq[1], seq[2], seq[3], seq[5], x+1);
			for(int j=1;j<=4;j++){ if(j==x || !seq[j]) continue;
				seq[j]--; seq[x] ++;
				dfs(seq[1], seq[2], seq[3], seq[5], x+1);
				for(int k=1;k<=4;k++){ if(k==x || !seq[k]) continue;
					seq[k] --; seq[x] ++;
					dfs(seq[1], seq[2], seq[3], seq[5], x+1);
					seq[k] ++; seq[x] --;
				}
				seq[j]++; seq[x] --;
			}
			seq[i]++; seq[x] --;
		}
	}else if(x==5){
		for(int i=1;i<=4;i++){ 
			if(!seq[i]) continue;
			seq[i]--; seq[5]++;
			dfs(seq[1], seq[2], seq[3], seq[5], x+1);
			seq[i]++; seq[5]--;
		}
	}else{
		for(int i=1;i<=5;i++){
			if(!seq[i]) continue;
			for(int j=1;j<=5;j++){
				seq[i]--; seq[j]++;
				dfs(seq[1], seq[2], seq[3], seq[5], x+1);
				seq[i]++; seq[j]--;
			}
		}
	}
}
void procedure(){
	memset(dp, 0, sizeof(dp));
	n=read(); memset(c,0,sizeof(c));
	for(int i=1;i<=n;i++){
		scanf("%s", s);
		c[id[s[1]]]++;
	}
	ans=0;
	for(int i=1;i<=6;i++) has[i]=read();
	dfs(c[1], c[2], c[3], c[5], 1);
	printf("%d\n", ans);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	id['D']=1; id['C']=2; id['H']=3; id['S']=4;

	ll T=read();
	init();
	while(T--) procedure();
	return 0;
}