#include "bits/stdc++.h"
using namespace std;

#define ll long long 
#define INF 0x3f3f3f3f
#define LNF 0x3f3f3f3f3f3f3f3fll
#define MOD 998244353
#define pii pair<int, int>
#define vi vector<int> 
#define N 100010

int sim(int msk, vi& buk, int sh, int wild) {
    if (msk == 0) {
        int res = 0;
        vi cur = buk;
        vi ord(cur.size());
        iota(ord.begin(), ord.end(), 0);
        sort(ord.begin(), ord.end(), [&](auto& x, auto& y) {
            return cur[x] % 5 > cur[y] % 5;
        });
        for (auto x : ord) {
            int d = min(5 - (cur[x] % 5), wild);
            cur[x] += d, wild -= d;
            d = min(cur[x] % 5, sh);
            cur[x] -= d, sh -= d;
        }
        for (auto x : cur) res += x / 5;
        res -= (sh + 4) / 5;

        if (sh) return 0;
        return res;
    }

    int res = 0;
    for (int i = 0; i < 6; ++ i) {
        if ((msk >> i) & 1) {
            int cur = msk - (1 << i);
            res = max(res, sim(cur, buk, sh, wild));
            
            if (i < 4) {
                buk[i] += 3;
                res = max(res, sim(cur, buk, sh+3, wild));
                buk[i] -= 3;
            }
            
            if (i == 4) {
                for (int j = 0; j < 4; ++ j) {
                    if (!buk[j]) continue;
                    buk[j] --;
                    res = max(res, sim(cur, buk, sh, 1));
                    buk[j] ++;
                }
            }

            if (i == 5) {
                if (wild) {
                    res = max(res, sim(cur, buk, sh, wild+1));
                } else {
                    for (int j = 0; j < 4; ++ j) {
                        if (!buk[j]) continue;
                        buk[j] ++;
                        res = max(res, sim(cur, buk, sh+1, wild));
                        buk[j] --;
                    }
                }
            }
        }
    }
    return res;
}

int main() {
#ifdef TEST
    freopen("zz.in", "r+", stdin);
#endif
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    unordered_map<char, int> mp;
    mp['D'] = 0;
    mp['C'] = 1;
    mp['H'] = 2;
    mp['S'] = 3;

    int t; cin >> t;
    while (t --) {
        int n; cin >> n;
        vi buk(4, 0);
        for (int i = 0; i < n; ++ i) {
            string s; cin >> s;
            buk[mp[s[1]]] ++;
        }
        int msk = 0;
        for (int i = 0; i < 6; ++ i) {
            int x; cin >> x; msk |= (x << i);
        }

        cout << sim(msk, buk, 0, 0) << '\n';
    }
}