// #pragma GCC optimize(3)
#include <bits/stdc++.h>

#ifndef ONLINE_JUDGE
#include "../../dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
#define IOS_FAST ios::sync_with_stdio(false), cin.tie(0);

using namespace std;

// #define int long long

// D C H S
map<char, int> mp = { {'D', 0}, {'C', 1}, {'H', 2}, {'S', 3}, {'W', 4} };

set<pair<array<int, 5>, array<int, 5>>> st;

/*
3 3 2 3
4 4 6 7
*/


int dfs(array<int, 5> vec, array<int, 6>& tar)
{
    int res = 0;
    {
        int wc = vec[4];
        array<int, 5> tmpArr = vec;
        for (int i = 0; i < 4; ++i)
        {
            res += tmpArr[i] / 5;
            tmpArr[i] %= 5;
        }
        sort(tmpArr.begin(), tmpArr.begin() + 4, greater<int>());
        dbg(tar);
        dbg(tmpArr);
        for (int i = 0; i < 4; ++i)
        {
            if (tmpArr[i] + wc >= 5) { wc -= max(0, 5 - tmpArr[i]); res++; }
        }
    }

    if (tar[4] > 0)
    {
        tar[4]--;
        vec[4]++;
        for (int i = 0; i < 4; ++i)
        {
            if (vec[i] <= 0) continue;
            array<int, 5>  tmpVec = vec;
            tmpVec[i]--;
            if (st.count({ vec, tmpVec }) || st.count({ tmpVec, vec })) { continue; }
            st.insert(make_pair(vec, tmpVec));
            // cerr << "Use 4" << '\n';
            res = max(res, dfs(tmpVec, tar));
        }
        tar[4]++;
        vec[4]--;
    }

    for (int i = 0; i < 4; ++i)
    {
        if (tar[i] <= 0) continue;
        tar[i]--;

        for (int mx = 0; mx <= 3; ++mx)
            for (int my = 0; my + mx <= 3; ++my)
                for (int mz = 0; mx + my + mz <= 3; ++mz)
                {
                    const int amt = mx + my + mz;
                    const int vv[] = { mx, my, mz };
                    int ptr = 0;
                    array<int, 5> tmpVec = vec;
                    bool valid = true;
                    for (int ttt = 0; ttt < 4; ++ttt)
                    {
                        if (ttt == i) continue;
                        tmpVec[ttt] -= vv[ptr++];
                        if (tmpVec[ttt] < 0) { valid = false; break; }
                    }
                    if (valid == false) continue;
                    tmpVec[i] += amt;
                    if (st.count({ vec, tmpVec }) || st.count({ tmpVec, vec })) { continue; }
                    st.insert(make_pair(vec, tmpVec));
                    // cerr << "Use " << i << '\n';
                    res = max(res, dfs(tmpVec, tar));
                }
        tar[i]++;
    }


    if (tar[5] > 0)
    {
        tar[5]--;
        for (int i = 0; i < 5; ++i)
        {
            if (vec[i] <= 0) continue;
            for (int j = 0; j < 5; ++j)
            {
                if (j == i || vec[j] <= 0) continue;
                array<int, 5>  tmpVec = vec;
                tmpVec[i]++; tmpVec[j]--;
                if (st.count({ vec, tmpVec }) || st.count({ tmpVec, vec })) { continue; }
                st.insert({ vec, tmpVec });
                // cerr << "Use 5" << '\n';
                res = max(res, dfs(tmpVec, tar));
                // vec[j]++; vec[i]--;
            }
        }
        tar[5]++;
    }
    return res;
}

signed main()
{
    IOS_FAST;
    int t;
    cin >> t;
    while (t--)
    {
        st.clear();
        int n;
        cin >> n;
        vector<int> cnt(4, 0);
        for (int i = 0; i < n; ++i)
        {
            string s;
            cin >> s;
            cnt[mp[s[1]]]++;
        }
        array<int, 6> bt;
        for (int i = 0; i < 6; ++i)
            cin >> bt[i];

        int res = 0;
        for (int i = 0; i < 4; ++i)
        {
            res += cnt[i] / 5;
            cnt[i] %= 5;
        }
        array<int, 5> bc = { cnt[0],cnt[1],cnt[2],cnt[3], 0 };
        st.insert({ {-1, -1, -1, -1, -1}, bc });
        res += dfs(bc, bt);
        cout << res << '\n';
    }
    return 0;
}