#include<bits/stdc++.h>
#define ll long long

using namespace std;

void solve()
{
    int n; cin >> n;
    vector<int>t(6), cnt(4);
    map<char, int>ha;
    ha['D'] = 0, ha['C'] = 1, ha['H'] = 2, ha['C'] = 3;
    while (n--) {
        string s; cin >> s;
        cnt[ha[s[1]]]++;
    }
    for (int i = 0; i < 6; i++)cin >> t[i];

    vector<vector<int>>v;

    for (int k = 0; k < 64; k++) {
        vector<int>c;
        for (int j = 0, st = k; j < 3; j++, st /= 4) {
            if (st % 4)c.push_back(st % 4);
        }
        bool ok = 1;
        for (auto k : v)if (k == c)ok = 0;
        if (ok)v.push_back(c);
    }

    int res = 0;
    auto dfs = [&](auto && self, int i, vector<int>cnt)->void{
        for (int j = 0; j < 4; j++) {
            int t = cnt[j] + (i <= j) * 3 + 2;
            if (t < 0)return;
        }
        if (i == 6) {
            int ans = 0 ;
            for (int j = 0; j < 4; j++) {
                if (cnt[j] < 0)return;
                ans += cnt[j] / 5;
            }
            res = max(res, ans);
            return;
        }
        else if (i >= 4) {
            self(self, i + 1, cnt);
            if (t[i]) {
                for (int k = 0; k < 4; k++)
                    for (int j = k + 1; j < 4; j++) {
                        cnt[k]--, cnt[j]++;
                        self(self, i + 1, cnt);
                        cnt[k]++, cnt[j]--;
                    }
            }
        }
        else{
            self(self, i + 1, cnt);
            if (t[i]) {
                for (auto c : v) {
                    for (auto t : c) {
                        cnt[(t + i) % 4]--;
                        cnt[i]++;
                    }
                    self(self, i + 1, cnt);
                     for (auto t : c) {
                        cnt[(t + i) % 4]++;
                        cnt[i]--;
                    }
                }
            }
        }
    };
    dfs(dfs, 0, cnt);
    cout << res << '\n';
}

int main()
{
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1; cin >> t;
    while (t--)solve();
    return 0;
}