#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pii pair<int, int>
using namespace std;
const int maxn = (1 << 16) + 10;
int dp[maxn][16];
int pre[16][16];
int T, a0, a1, a2, a3;
void init() {
    memset(pre, 0x3f, sizeof pre);
    for (int i = 0; i < 16; i++) {
        for (int j = 0; j < 4; j++) {
            pre[i][i ^ (1 << j)] = a0;
        }
        pre[i][i ^ 12] = pre[i][i ^ 3] = a1;
        pre[i][i ^ 10] = pre[i][i ^ 5] = a2;
        pre[i][i ^ 15] = a3;
    }
    for (int k = 0; k < 16; k++)
        for (int i = 0; i < 16; i++)
            for (int j = 0; j < 16; j++)
                pre[i][j] = min(pre[i][j], pre[i][k] + pre[k][j]);
}
void solve() {
    while (T--) {
        int m; cin >> m;
        int x = 0;
        while (m--) {
            int y = 0;
            for (int i = 0; i < 4; i++) {
                char ch; cin >> ch;
                y = y * 2 + ch - '0';
            }
            x |= 1 << y;
        }
        int ans = dp[x][15];
        cout << ans << "\n";
    }
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> T >> a0 >> a1 >> a2 >> a3;
    init();
    memset(dp, 0x3f, sizeof dp);
    for (int i = 0; i < 16; i++) dp[0][i] = 0;
    for (int i = 0; i < (1 << 16); i++) {
        for (int j = 0; j < 16; j++)
            for (int k = 0; k < 16; k++) {
                dp[i | (1 << (15 ^ k))][k] = min(dp[i | (1 << (15 ^ k))][k], dp[i][j] + pre[j][k]);
                dp[i][k] = min(dp[i][k], dp[i][j] + pre[j][k]);
            }
    }
    while (t--) solve();
    return 0;
}