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

using node = tuple<int, int, int>;
int q, w[4], a[1 << 4], dp[1 << 4][1 << 16], ans[1 << 16];

/*
01
23

12
48
*/

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    cin >> q >> w[0] >> w[1] >> w[2] >> w[3];

    a[1] = a[2] = a[4] = a[8] = w[0];
    a[1 + 2] = a[4 + 8] = w[1];
    a[1 + 4] = a[2 + 8] = w[2];
    a[1 + 2 + 4 + 8] = w[3];

    vector<int> e;
    for(int i = 0; i < 16; i ++) if(a[i]) e.push_back(i);

    memset(dp, 0x7f, sizeof dp);
    memset(ans, 0x7f, sizeof ans);
    dp[0][0] = 0;
    
    {
        priority_queue<node> q;
        q.push({0, 0, 0});
        while(q.size()) {
            auto [x, u, b] = q.top();
            q.pop();
            if(x > dp[u][b]) continue;
            //cout << x << " " << bitset<4>(u) << " " << bitset<16>(b) << "\n";
            ans[b] = min(ans[b], x);
            for(int msk : e) {
                int v = u ^ msk, tb = b | (1 << v);
                if(x + a[msk] < dp[v][tb]) {
                    dp[v][tb] = x + a[msk];
                    q.push({x + a[msk], v, tb});
                }
            }
        }
    }

    for(int i = 0; i < 16; i ++)
        for(int j = 0; j < (1 << 16); j ++)
            if(!((j >> i) & 1)) ans[j] = min(ans[j], ans[j ^ (1 << i)]);

    while(q --) {
        int m, msk = 0;
        cin >> m;
        for(int i = 1; i <= m; i ++) {
            char c[4];
            cin >> c[0] >> c[1] >> c[2] >> c[3];
            msk |= 1 << (15 ^ ((c[0] - '0') * 1 + (c[1] - '0') * 2 + (c[2] - '0') * 4 + (c[3] - '0') * 8));
        }
        //cout << bitset<16>(msk) << " ";
        cout << ans[msk] << "\n";
    }
}