#include<bits/stdc++.h>
using namespace std;

#define int long long

typedef pair<int, int> pii;
typedef long long LL;
typedef unsigned long long uLL;

const int inf32 = 1e9;
const LL inf64 = 1e18;

const int d[10][5] = {{0, 0, 0, 0, 0}, 
                      {0, 1, 0, 0, 0},
                      {0, 0, 1, 0, 0},
                      {0, 0, 0, 1, 0},
                      {0, 0, 0, 0, 1},
                      {0, 1, 1, 0, 0},
                      {0, 0, 0, 1, 1},
                      {0, 1, 0, 1, 0},
                      {0, 0, 1, 0, 1},
                      {0, 1, 1, 1, 1}};

struct node {
    int cost, id, S;
};

bool operator < (node x, node y) {
    return x.cost > y.cost;
}

signed main()
{
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);

    int T, a1, a2, a3, a4;
    cin >> T >> a1 >> a2 >> a3 >> a4;
    
    vector<vector<int>> dis(20, vector<int>(20, inf64));
    for (int i = 1; i <= 17; i++) dis[i][i] = 0;
    for (int i = 0; i <= 15; i++) {
        vector<int> a(5, 0);
        for (int j = 1; j <= 4; j++)
            a[j] = i >> (j - 1) & 1;
        // if (i == 17) a[1] = a[2] = a[3] = a[4] = 1;
        for (int k = 1; k <= 9; k++) {
            int cost = 0;
            if (k <= 4) cost = a1;
                else if (k <= 6) cost = a2;
                else if (k <= 8) cost = a3;
                else cost = a4;
            
            int v = 0;
            for (int j = 1; j <= 4; j++)
                v += (a[j] ^ d[k][j]) * (1 << (j - 1));
            if (v == 15) v = 16;
            dis[i][v] = min(dis[i][v], cost);
            // dis[i][17] = min(dis[i][17], cost);
        }
    }
    for (int k = 0; k <= 16; k++)
        for (int i = 0; i <= 16; i++)
            for (int j = 0; j <= 16; j++)
                dis[i][j] = min(dis[i][j], dis[i][k] + dis[k][j]);


    // for (int i = 0; i <= 16; i++) {
    //     for (int j = 0; j <= 16; j++)
    //         cerr << dis[i][j] << ' ';
    //         cerr<<endl;
    // }

    vector<vector<int>> dp(20, vector<int>((1 << 18) + 5, inf64)), vis(20, vector<int>((1 << 18) + 5, 0));
    priority_queue<node> q;
    for (int i = 0; i <= 16; i++)
        dp[i][1 << i] = 0, q.push({0, i, 1 << i});
    
    while (!q.empty()) {
        auto [cost, cur, S] = q.top();
        q.pop();

        if (vis[cur][S]) continue;
        vis[cur][S] = 1;

        for (int v = 0; v <= 16; v++) {
            if (dis[cur][v] == inf64) continue;

            if (dp[cur][S] + dis[cur][v] < dp[v][S | (1 << v)]) {
                dp[v][S | (1 << v)] = dp[cur][S] + dis[cur][v];
                q.push({dp[v][S | (1 << v)], v, S | (1 << v)});
            }
        }
    }
    for (int i = 1; i < (1 << 18); i++) {
        for (int j = 0; j <= 16; j++)
            if (i >> j & 1) dp[16][i ^ (1 << j)] = min(dp[16][i ^ (1 << j)], dp[16][i]);
    }
    while (T--) {
        int n;
        cin >> n;
        int S = 1 << 16;
        for (int i = 1; i <= n; i++) {
            string str = "";
            while (str == "") cin >> str;
            int id = 0;
            id += 1 * (str[0] ^ 48);
            id += 2 * (str[1] ^ 48);
            cin >> str;
            id += 4 * (str[0] ^ 48);
            id += 8 * (str[1] ^ 48);
            S |= 1 << id;
        }

        cout << dp[16][S] << "\n";
    }

    return 0;
}