#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

int a[9];
int dis[17];
int fix(int x, int op){
    if(op < 4)
        return x ^ (1 << op);
    else if(op < 6){
        if(op == 4)
            return x ^ 3;
        else
            return x ^ 12;
    }
    else if(op < 8){
        if(op == 6)
            return x ^ 5;
        else
            return x ^ 10;
    }
    else return x ^ 15;
}

void per(){
    cin >> a[0] >> a[4] >> a[6] >> a[8];
    a[1] = a[2] = a[3] = a[0];
    a[5] = a[4];
    a[7] = a[6];
    for(int i = 0 ; i < 17 ;i ++ )
        dis[i] = 1e9;
    dis[15] = 0;
    priority_queue<pair<int,int>> q;
    q.push({0,15});
    while(!q.empty()){
        pair<int,int> tmp = q.top();
        q.pop();
        if(tmp.first > dis[tmp.second]) continue;
        for(int i = 0 ; i < 9 ; i ++ ){
            int pos = fix(tmp.second,i);
            if(dis[pos] > a[i] + dis[tmp.second]){
                dis[pos] = a[i] + dis[tmp.second];
                q.push({dis[pos],pos});
            }
        }
    }
    dis[15] = 2 * min({a[0],a[4],a[6],a[8]});
}
int ge[17];
void solve()
{
    int n;
    cin >> n;
    for(int i = 0 ; i < n ; i ++ ){
        int x = 0;
        if(i != 0) getchar();
        string s;
        for(int j = 0 ; j < 2 ; j++ ){
            cin >> s;
            for(int k = 0 ; k < 2; k ++ )
                if(s[k] == '1')
                    x += (1 << k + 2 * j);
        }
        ge[i] = x;
    }
    int ans = 0;
    while(1){
        int pos = 17 ,d = 1e9;
        for(int i = 0 ;i < n ; i++ ){
            if(ge[i] != -1 && dis[ge[i]] < d){
                pos = i;
                d = dis[ge[i]];
            }
        }
        if(d == 1e9) break;
        ans += d;
        for(int i = 0 ; i <n ; i ++ )
            if(ge[i] != -1 && i != pos)
                ge[i] ^= (15 ^ ge[pos]);
        ge[pos] = -1;
    }
    cout << ans << endl;
}

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