#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 200005;
ll t, n;
using pci = pair<char, int>;

int main()
{
	cin >> t;
	while(t--)
	{
		cin >> n;
		unordered_map <char, int> mp;
		for(int i = 1;i <= n;i++)
		{
			string s;
			cin >> s;
			mp[s[1]]++;
		}
		
		vector <pci> a(mp.begin(), mp.end());
		// sort(a.begin(), a.end(), [](const pci& x, const pci& y)
		// {
			// return x.first < y.first;
		// });
		ranges::sort(a);	
				
		int ans = 0;
		for(auto &[_, x] : a)
		{
			ans += x / 5;
			x %= 5;
		}
		
		
		vector <int> b(6);
		cin >> b[1] >> b[0] >> b[2] >> b[3] >> b[4] >> b[5];
		
		int plus = 0;
		for(int i = 0;i < (1 << 4);i++)
		{
			vector <int> temp;
			int sum = 0;
			for(int j = 0;j < 4;j++)
			{
				if(i >> j && 1)
				{
					temp.push_back(j);
				}
				else 
				{
					sum += a[j].second;
				}
			}
			
			auto temp_a = a;
			int u = b[4] + b[5];
			int plus_temp = 0;
			for(auto x : temp)
			{
				if(b[x])
				{
					int t = min({5 - temp_a[x].second, 3, sum});
					sum -= t;
					temp_a[x].second += t;
				}
				
				if(temp_a[x].second != 5)
				{
					while(u && sum && temp_a[x].second < 5)
					{
						temp_a[x].second++; u--; sum--;
					}
				}
				
				if(temp_a[x].second == 5)
				{
					plus_temp++;
				}
				plus = max(plus, plus_temp);
			}
		}
		cout << ans + plus << endl;
	}
	
	
	return 0;
}