#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> PII;

const int MAXN = 1e6 + 10;
const int MM = 1e9 + 7;

// 通用网络流(Sap + Johnson + 上下界) By 猛犸也钻地 @ 2012.02.10

#include <cstring>
#include <queue>
#include <algorithm>
using namespace std;

class Network {
public:
    typedef int VAL; 
    static const int SIZE = 100; 
    static const int INF = 1000000007;
    typedef struct ARC{int t,c; VAL w; ARC* o;}* PTR;
    ARC arc[10000];
    PTR now[SIZE],e[SIZE]; 
    int cnt[SIZE],l[SIZE],r[SIZE],edge;
    VAL sum;
    void clear(){memset(e,edge=sum=0,sizeof(e));}
    ARC& REV(PTR x){return arc[(x-arc)^1];}
    int flow(int S, int T){return spfa_johnson(S,T,INF);}
    PTR add_edge(int x, int y, int c, VAL w = 0){
        e[x]=&(arc[edge++]=(ARC){y,c,+w,e[x]});
        e[y]=&(arc[edge++]=(ARC){x,0,-w,e[y]});
        return e[x];
    }
    int aug(int S, int T, int& can){
        int x,z=T,use=can;
        for(x=S;x!=T;x=now[x]->t) if(use>now[x]->c) use=now[z=x]->c;
        for(x=S;x!=T;x=now[x]->t){
                now[x]->c-=use;
            REV(now[x]).c+=use;
            sum+=use*now[x]->w;
        }
        can-=use;
        return z;
    }
    int spfa_johnson(int S, int T, int can){
        if(S==T) return can;
        int in=can,x,m;
        VAL phi[SIZE],len[SIZE],MAXW=1000000007;
        memset(l,0,sizeof(l));
        fill_n(phi,SIZE,MAXW);
        phi[r[0]=T]=0;
        for(int i=m=0;i<=m;i++){
            l[x=r[i%SIZE]]=0;
            for(PTR u=e[x];u;u=u->o){ 
                if(phi[x]+REV(u).w>=phi[u->t] || !REV(u).c) continue;
                phi[u->t]=phi[x]+REV(u).w;
                if(!l[u->t]) l[r[++m%SIZE]=u->t]=1;
            }
        }
        do{
            typedef pair<VAL,int> TPL;
            priority_queue<TPL> q;
            fill_n(len,SIZE,MAXW);
            memset(l,0,sizeof(l));
            q.push(TPL(len[T]=0,T));
            while(q.size()){
                x=q.top().second; q.pop();
                if(!l[x]) l[x]=1; else continue;
                for(PTR u=e[x];u;u=u->o){
                    if(!REV(u).c || l[u->t]) continue;
                    VAL at=len[x]+phi[x]+REV(u).w-phi[u->t];
                    if(at>=len[u->t]) continue; 
                    len[u->t]=at;
                    now[u->t]=&REV(u);
                    q.push(TPL(-at,u->t));
                }
            }
            for(x=0;x<SIZE;x++) phi[x]+=len[x];
        }while(phi[S]<MAXW && aug(S,T,can)!=T);
        return in-can;
    }
} nico;

int n, A, B, C;
string t[6];
char s[11];
int cnt[111];

void solve(int casi){
    scanf("%d%d%d%d", &n, &A, &B, &C);
    t[0] = "012";
    t[1] = "021";
    t[2] = "102";
    t[3] = "120";
    t[4] = "201";
    t[5] = "210";
    for (int i = 0; i < 6; i++) cnt[i] = 0;
    for (int i = 0; i < n; i++) {
        scanf("%s", s);
        string ss;
        for (int j = 0; j < 3; j++) ss.push_back(s[j]);
        for (int j = 0; j < 6; j++) {
            if (ss == t[j]) {
                cnt[j]++;
            }
        }
    }
    nico.clear();
    for (int i = 0; i < 6; i++) {
        nico.add_edge(0, i + 1, cnt[i], -1003);
        int p = t[i][0] - '0';
        int q = t[i][1] - '0';
        int r = t[i][2] - '0';
        nico.add_edge(i + 1, 7 + p, cnt[i], 0);
        nico.add_edge(i + 1, 7 + q, cnt[i], 1);
        nico.add_edge(i + 1, 7 + r, cnt[i], 2);
    }
    nico.add_edge(7, 10, A, 0);
    nico.add_edge(8, 10, B, 0);
    nico.add_edge(9, 10, C, 0);
    int res = nico.flow(0, 10);
    // cerr << "?? " << res << ' ' << n << endl;
    printf("%d\n", -(nico.sum + n * 1000));
}

int main(){
    int T = 1;
    scanf("%d", &T);
    for (int i = 1; i <= T; i++)
        solve(i);
    return 0;
}