#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int M = 6;

map<vector<int>, int> cache[1 << M];
int solve(int p, const vector<int> &as) {
  auto it = cache[p].find(as);
  if (it != cache[p].end()) return it->second;
  int ret = 0;
  
  for (int i = 0; i < 4; ++i) ret += as[i] / 5;
  
  // make <=3
  for (int m = 0; m < 4; ++m) if (p & 1 << m) {
    int ds[5];
#define rep(i) for (ds[i] = 0; ds[i] <= 3 && ds[i] <= as[i]; ++ds[i])
    rep(0) rep(1) rep(2) rep(3) rep(4) {
      int sumD = 0;
      for (int i = 0; i < 5; ++i) sumD += ds[i];
      if (sumD <= 3) {
        auto bs = as;
        for (int i = 0; i < 5; ++i) bs[i] -= ds[i];
        bs[m] += sumD;
        chmax(ret, solve(p ^ 1 << m, bs));
      }
    }
#undef rep
  }
  
  // make wild
  if (p & 1 << 4) {
    for (int i = 0; i < 5; ++i) if (as[i]) {
      auto bs = as;
      --bs[i];
      ++bs[4];
      chmax(ret, solve(p ^ 1 << 4, bs));
    }
  }
  
  // copy
  if (p & 1 << 5) {
    for (int i = 0; i < 5; ++i) if (as[i]) {
      for (int j = 0; j < 5; ++j) if (as[j]) {
        auto bs = as;
        --bs[i];
        ++bs[j];
        chmax(ret, solve(p ^ 1 << 5, bs));
      }
    }
  }
  
  // use wild
  if (as[4]) {
    for (int i = 0; i < 4; ++i) {
      auto bs = as;
      --bs[4];
      ++bs[i];
      chmax(ret, solve(p, bs));
    }
  }
  
// for(int m=0;m<6;++m)cerr<<(p>>m&1);cerr<<" "<<as<<": "<<ret<<endl;
  return cache[p][as] = ret;
}

int main() {
  char buf[10];
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    int N;
    scanf("%d", &N);
    vector<string> cards(N);
    for (int n = 0; n < N; ++n) {
      scanf("%s", buf);
      cards[n] = buf;
    }
    int T[M];
    for (int m = 0; m < M; ++m) {
      scanf("%d", &T[m]);
    }
    
    vector<int> as(5, 0);
    for (int n = 0; n < N; ++n) ++as[string("DCHS").find(cards[n][1])];
    int p = 0;
    for (int m = 0; m < M; ++m) p |= T[m] << m;
    
    const int ans = solve(p, as);
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}