/*
Undo the destiny.
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair

const int N = 1e5 + 10;

ll dp[N],a[4];
int bt[4] = {1,2,4,8};
bool flag;

void dfs(int sta,int now,ll dis) {
    int nsta;
    //cout << sta << " " << now << " " << dis << "\n";
    if (dis >= dp[sta]) {
        return ;
    }
    if (flag) dp[sta] = min(dp[sta],dis);
    flag = 1;
    for (int i = 0;i < 4;++i) {
        now ^= bt[i];
        nsta = sta | (1 << now);
        dfs(nsta,now,dis + a[0]);
        now ^= bt[i];
    }

    now ^= bt[0],now ^= bt[1];
    nsta = sta | (1 << now);
    dfs(nsta,now,dis + a[1]);
    now ^= bt[0],now ^= bt[1];

    
    now ^= bt[2],now ^= bt[3];
    nsta = sta | (1 << now);
    dfs(nsta,now,dis + a[1]);
    now ^= bt[2],now ^= bt[3];

    now ^= bt[0],now ^= bt[2];
    nsta = sta | (1 << now);
    dfs(nsta,now,dis + a[2]);
    now ^= bt[0],now ^= bt[2];

    
    now ^= bt[1],now ^= bt[3];
    nsta = sta | (1 << now);
    dfs(nsta,now,dis + a[2]);
    now ^= bt[1],now ^= bt[3];

    for (int i = 0;i < 4;++i) {
        now ^= bt[i];
    }
    nsta = sta | (1 << now);
    dfs(nsta,now,dis + a[3]);
}

void solve() {
    int n;cin >> n;
    int sta = 0;
    for (int i = 1;i <= n;++i) {
        string l = "";
        for (int i = 1;i <= 2;++i) {
            string s;cin >> s;
            l += s;
        }
        int now = 0;
        for (int i = 0;i < 4;++i) {
            now = now * 2 + (l[i] - '0');
        }
        sta |= (1 << now);
        //cout << now << "\n";
        //cout <<(1 << now) << "\n";
    }
    //cout << n << " " << sta << "\n";
    if (n == 1 && sta == 32768){
        cout << min(min(a[0],a[1]),min(a[2],a[3]))  * 2 << "\n";
        return ;
    }
    cout << dp[sta] << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);//cout.tie(0);
    int T;cin >> T;
    for (int i = 0;i < 4;++i) cin >> a[i];
    memset(dp,0x3f,sizeof dp);
    dfs(0,15,0);
    for (int i = (1 << 15) - 1;i >= 0;--i) {
        for (int j = 0;j < 15;++j) {
            if (i >> j & 1) {
                int nxt = i ^ (1 << j);
                dp[nxt] = min(dp[nxt],dp[i]);
            }
        }
    }
    while (T--) solve();
    return 0;
}
/*
2 1000 100 10 1
4
10
00

01
00

00
10

00
01

1
11
11
*/