#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef unsigned long long ull;
typedef __int128 lll;
typedef pair<ll, ll> P;
#define x first
#define y second
#define int long long

// const int mod = 1e9 + 7;
const int pp = 998244353;

const int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1}, dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int ddx[8] = {1, 1, 2, 2, -1, -1, -2, -2}, ddy[8] = {2, -2, 1, -1, 2, -2, 1, -1};

ll ksm(ll a, ll b, ll p) {
    ll ans = 1;
    a %= p;
    while(b) {
        if(b & 1) ans = (ans * a) % p;
        b >>= 1;
        a = (a * a) % p;
    }
    return ans % p;
}

std::mt19937 rng;  // 随机数生成器  
int rand(int l, int r) {
    std::uniform_int_distribution<int> distribution(l, r);
    return distribution(rng);
}



void solve() {
    int n;
    cin >> n;
    int c[5] = {};
    map<char, int> mp;
    mp['D'] = 1;
    mp['C'] = 2;
    mp['H'] = 3;
    mp['S'] = 4;
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;
        c[mp[s.back()]] ++ ;
    }
    int t[7] = {};
    for(int i = 1; i <= 6; i++) {
        cin >> t[i];
    }

    int ans = 0;
    priority_queue<int> A;
    priority_queue<int, vector<int>, greater<>> B;
    for(int i = 1; i <= 4; i++) {
        ans += c[i] / 5;
        c[i] %= 5;
        if(t[i]) {
            A.emplace(c[i]);
        } else {
            B.emplace(c[i]);
        }
    }

    while(A.size() > 1 && A.top() == 0) {
        A.pop();
    }

    while(A.size()) {
        int need = 5 - A.top();
        A.pop();
        int sum = 0;
        while(B.size() && sum < need) {
            if(sum + B.top() <= need) {
                sum += B.top();
                B.pop();
            } else {
                int n_top = need - sum;
                B.pop();
                B.emplace(n_top);
                sum = need;
                break;
            }
        }
        while(A.size() && sum < need) {
            if(sum + A.top() <= need) {
                sum += A.top();
                A.pop();
            } else {
                int n_top = need - sum;
                A.pop();
                A.emplace(n_top);
                sum = need;
                break;
            }
        }
        if(sum < need) break;
        assert(sum == need);
        if(need == 4) {
            if(t[5]) {
                t[5] = 0;
            } else if(t[6]) {
                t[6] = 0;
            } else {
                break;
            }
        } else if(need == 5) {
            if(t[5] && t[6]) {
                ans ++ ;
                t[5] = t[6] = 0;
            }
            break;
        }
        ans ++ ;
    }
    
    vector<int> nB;
    while(B.size()) {
        nB.emplace_back(B.top());
        B.pop();
    }
    sort(nB.begin(), nB.end(), greater<>());
    while(nB.size() > 1) {
        int need = 5 - nB[0];
        nB.erase(nB.begin());
        if(need > 2) break;
        if(need == 1) {
            if(t[5]) {
                nB.back() -- ;
                t[5] = 0;
            } else if(t[6]) {
                nB.back() -- ;
                t[6] = 0;
            } else {
                break;
            }
            ans ++ ;
        } else {
            assert(need == 2);
            int sum = 0;
            for(auto & x : nB) {
                sum += x;
            }
            if(t[5] && t[6] && sum >= 2) {
                ans ++ ;
            } else {
                break;
            }
        }
    }
    cout << ans << endl;
}

/*



*/

signed main () {
    // init(minp, primes, m); // primes
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    // init();
    int _ = 1;
    cin >> _;
    while(_ -- ) {
        solve();
    }
    return 0;
}