/*
 * b.cpp 2024-11-27
 * Copyright (C) 2024 Woshiluo Luo <[email protected]>
 *
 * 「Two roads diverged in a wood,and I—
 * I took the one less traveled by,
 * And that has made all the difference.」
 *
 * Distributed under terms of the GNU GNU AGPLv3+ license.
 */

#include <cstdio>
#include <cstdint>
#include <cstring>
#include <cstdlib>

#include <map>
#include <vector>
#include <algorithm>

using i32 = int32_t;
using u32 = uint32_t;
using ci32 = const int32_t;
using cu32 = const uint32_t;

using i64 = int64_t;
using u64 = uint64_t;
using ci64 = const int64_t;
using cu64 = const uint64_t;

inline bool isdigit( const char cur ) { return cur >= '0' && cur <= '9'; }/*{{{*/
template <class T> 
constexpr T Max( T a, T b ) { return a > b? a: b; }
template <class T> 
constexpr T Min( T a, T b ) { return a < b? a: b; }
template <class T> 
void chk_Max( T &a, T b ) { if( b > a ) a = b; }
template <class T> 
void chk_Min( T &a, T b ) { if( b < a ) a = b; }
template <typename T>
T read() { 
	T sum = 0, fl = 1; 
	char ch = getchar();
	for (; isdigit(ch) == 0; ch = getchar())
		if (ch == '-') fl = -1;
	for (; isdigit(ch); ch = getchar()) sum = sum * 10 + ( ch - '0' );
	return sum * fl;
}
template <class T> 
constexpr T pow( T a, i32 p ) {
	T res = 1;
	while( p ) {
		if( p & 1 ) 
			res = res * a;
		a = a * a;
		p >>= 1;
	}
	return res;
}/*}}}*/

const int N = 10;

char buf[N];

std::map<std::pair<std::vector<i32>, std::vector<i32>>, int32_t> mp;

int dfs( const std::vector<i32> &cnt, const std::vector<i32> &t ) {
	const auto pair = std::make_pair( cnt, t );
	if( mp.count(pair) )
		return mp[pair];
	ci32 cnt_0 = cnt[0];
	ci32 cnt_1 = cnt[1];
	ci32 cnt_2 = cnt[2];
	ci32 cnt_3 = cnt[3];
	ci32 cnt_4 = cnt[4];
	auto &res = mp[pair];
	res = 0;
	if( cnt_0 + cnt_4 >= 5 ) {
		ci32 need = Max( 5 - cnt_0, 0 );
		res = dfs( { Max( cnt_0 - 5, 0 ), cnt_1, cnt_2, cnt_3, cnt_4 - need }, t ) + 1;
		return res;
	}
	if( cnt_1 + cnt_4 >= 5 ) {
		ci32 need = Max( 5 - cnt_1, 0 );
		res = dfs( { cnt_0, Max( cnt_1 - 5, 0 ), cnt_2, cnt_3, cnt_4 - need }, t ) + 1;
		return res;
	}
	if( cnt_2 + cnt_4 >= 5 ) {
		ci32 need = Max( 5 - cnt_2, 0 );
		res = dfs( { cnt_0, cnt_1, Max( cnt_2 - 5, 0 ), cnt_3, cnt_4 - need }, t ) + 1;
		return res;
	}
	if( cnt_3 + cnt_4 >= 5 ) {
		ci32 need = Max( 5 - cnt_3, 0 );
		res = dfs( { cnt_0, cnt_1, cnt_2, Max( cnt_3 - 5, 0 ), cnt_4 - need }, t ) + 1;
		return res;
	}
	for( int p0 = 0; p0 <= cnt_0; p0 ++ ) {
		for( int p1 = 0; p1 <= cnt_1; p1 ++ ) {
			for( int p2 = 0; p2 <= cnt_2; p2 ++ ) {
				for( int p3 = 0; p3 <= cnt_3; p3 ++ ) {
						ci32 ori_total = cnt_0 + cnt_1 + cnt_2 + cnt_3 + cnt_4;
						ci32 nxt_total = p0 + p1 + p2 + p3 + cnt_4;
						ci32 diff = ori_total - nxt_total;
						if( diff == 0 ) 
							continue;
						if( diff <= 3 ) {
							for( int p5 = 0; p5 < 4; p5 ++ ) {
								if( t[p5] ) {
									auto p = t;
									p[p5] = 0;
									std::vector<i32> nxt = { p0, p1, p2, p3, cnt_4 };
									nxt[p5] += diff;
									chk_Max( res, dfs( nxt, p ) );
								}
							}
					}
				}
			}
		}
	}
	if( t[4] ) {
		auto p = t;
		p[4] = 0;
		for( int p4 = 0; p4 < 4; p4 ++ ) {
			if( cnt[p4] ) {
				std::vector<i32> nxt = cnt;
				nxt[p4] -= 1;
				nxt[4] += 1;
				chk_Max( res, dfs( nxt, p ) );
			}
		}
	}
	if( t[5] ) {
		auto p = t;
		p[5] = 0;
		for( int p4 = 0; p4 < 5; p4 ++ ) {
			for( int p5 = 0; p5 < 5; p5 ++ ) {
				if( p4 == p5 )
					continue;
				if( cnt[p4] && cnt[p5] ) {
					std::vector<i32> nxt = cnt;
					nxt[p4] --;
					nxt[p5] ++;
					chk_Max( res, dfs( nxt, p ) );
				}
			}
		}
	}

	return res;
}

int main() {
#ifdef woshiluo
	freopen( "b.in", "r", stdin );
	freopen( "b.out", "w", stdout );
#endif

	i32 T = read<i32>();
	while( T -- ) {
		ci32 n = read<i32>();
		int32_t cnt_0 = 0;
		int32_t cnt_1 = 0;
		int32_t cnt_2 = 0;
		int32_t cnt_3 = 0;
		for( int i = 1; i <= n; i ++ ) {
			scanf( "%s", buf );
			if( buf[1] == 'D' )
				cnt_0 ++;
			if( buf[1] == 'C' )
				cnt_1 ++;
			if( buf[1] == 'H' )
				cnt_2 ++;
			if( buf[1] == 'S' )
				cnt_3 ++;
		}
		std::vector<i32> t(6);
		for( int i = 0; i < 6; i ++ ) 
			t[i] = read<i32>();

		
		ci32 res = ( cnt_0 / 5 ) + ( cnt_1 / 5 ) + ( cnt_2 / 5 ) + ( cnt_3 / 5 ) 
			+ dfs( { cnt_0 % 5, cnt_1 % 5 , cnt_2 % 5, cnt_3 % 5, 0 }, t );
		printf( "%d\n", res );
	}
	
	return 0;
}