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

vector<int> c(5);

void solve()
{
    int n;
    cin >> n;

    set<vector<vector<int>>> st;
    for (int i = 0; i < n; i++)
    {
        char ch;
        cin >> ch;

        vector<vector<int>> tmp(2, vector<int>(2));
        tmp[0][0] = ch - '0';
        cin >> ch;
        tmp[0][1] = ch - '0';
        cin >> ch;
        tmp[1][0] = ch - '0';
        cin >> ch;
        tmp[1][1] = ch - '0';

        st.insert(tmp);
    }

    int ans = 0x3f3f3f3f;
    priority_queue<pair<int, set<vector<vector<int>>>>> pq;
    pq.push({0, st});

    set<set<vector<vector<int>>>> vis;

    while (!pq.empty())
    {
        auto [cost, s] = pq.top();
        pq.pop();

        if (s.size() == 0)
        {
            ans = min(ans, -cost);
            break;
        }

        // for (auto v : s)
        // {
        //     for (int i = 0; i < 2; i++)
        //     {
        //         for (int j = 0; j < 2; j++)
        //         {
        //             cout << v[i][j] << ' ';
        //         }
        //         cout << '\n';
        //     }
        //     cout << '\n';
        // }

        if (vis.count(s))
            continue;
        vis.insert(s);

        for (int i = 0; i < 2; i++)
        {
            for (int j = 0; j < 2; j++)
            {
                set<vector<vector<int>>> tmp;
                for (auto v : s)
                {
                    vector<vector<int>> t = v;
                    t[i][j] ^= 1;

                    if (t != vector<vector<int>>(2, vector<int>(2, 1)))
                        tmp.insert(t);
                }

                pq.push({cost - c[1], tmp});
            }
        }

        for (int i = 0; i < 2; i++)
        {
            set<vector<vector<int>>> tmp;
            for (auto v : s)
            {
                vector<vector<int>> t = v;
                for (int j = 0; j < 2; j++)
                    t[i][j] ^= 1;

                if (t != vector<vector<int>>(2, vector<int>(2, 1)))
                    tmp.insert(t);
            }

            pq.push({cost - c[3], tmp});
        }

        for (int i = 0; i < 2; i++)
        {
            set<vector<vector<int>>> tmp;
            for (auto v : s)
            {
                vector<vector<int>> t = v;
                for (int j = 0; j < 2; j++)
                    t[j][i] ^= 1;

                if (t != vector<vector<int>>(2, vector<int>(2, 1)))
                    tmp.insert(t);
            }

            pq.push({cost - c[2], tmp});
        }

        set<vector<vector<int>>> tmp;
        for (auto v : s)
        {
            vector<vector<int>> t = v;
            for (int i = 0; i < 2; i++)
            {
                for (int j = 0; j < 2; j++)
                {
                    t[i][j] ^= 1;
                }
            }
            if (t != vector<vector<int>>(2, vector<int>(2, 1)))
                tmp.insert(t);
        }

        pq.push({cost - c[4], tmp});
    }

    cout << ans << '\n';
}

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

    int t = 1;
    cin >> t;

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

    while (t--)
        solve();

    return 0;
}