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

signed main()
{
    // cin.tie(0)->ios::sync_with_stdio(false);

    int t = 1;
    cin >> t;

    vector<int> C(5);

    for (int i = 1; i <= 4; i++)
        cin >> C[i];

    map<set<int>, int> id;

    int _id = 0;
    auto dfs = [&](auto &&dfs, int x, set<int> st) -> void
    {
        if (id.count(st))
            return;
        id[st] = _id++;

        for (int i = x; i < 15; i++)
        {
            st.insert(i);
            dfs(dfs, i + 1, st);
            st.erase(i);
        }
    };

    id[{15}] = _id++;

    dfs(dfs, 0, {});

    vector<int> op = {0b0000, 0b1000, 0b0100, 0b0010, 0b0001, 0b1100, 0b0011, 0b1010, 0b0101, 0b1111};

    vector<vector<pair<int, int>>> g(_id);

    for (auto [st, _] : id)
    {
        for (int i = 1; i <= 9; i++)
        {
            set<int> tmp;
            for (auto v : st)
            {
                v ^= op[i];
                if (v < 15)
                    tmp.insert(v);
            }

            if (i <= 4)
                g[id[tmp]].push_back({_, C[1]});
            else if (i <= 6)
                g[id[tmp]].push_back({_, C[2]});
            else if (i <= 8)
                g[id[tmp]].push_back({_, C[3]});
            else
                g[id[tmp]].push_back({_, C[4]});
        }
    }

    // return 0;

    vector<int> dis(_id, 1e9);
    int s = id[{}];
    dis[s] = 0;

    priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;
    vector<bool> vis(_id);

    pq.push({0, s});

    while (pq.size())
    {
        auto [d, u] = pq.top();
        pq.pop();

        if (vis[u])
            continue;
        vis[u] = true;

        for (auto [v, w] : g[u])
        {
            if (dis[v] > dis[u] + w)
            {
                dis[v] = dis[u] + w;
                if (!vis[v])
                    pq.push({dis[v], v});
            }
        }
    }

    // return 0;

    while (t--)
    {
        int n;
        cin >> n;

        set<int> st;
        for (int k = 0; k < n; k++)
        {
            int num = 0;
            for (int i = 3; i >= 0; i--)
            {
                char ch;
                cin >> ch;
                num |= (ch == '1') << i;
            }
            st.insert(num);
        }

        cout << dis[id[st]] << '\n';
    }

    return 0;
}