#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

const int MAX_STATE = 16, INF = 1e9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    vector<int> a(4);
    cin >> a;

    vector dp(1 << MAX_STATE, vector<int>(MAX_STATE, INF));
    priority_queue<tuple<int, int, int>> pq;
    dp[0][0] = 0;
    pq.emplace(-dp[0][0], 0, 0);
    auto update = [&](int S, int cur, int val) {
        if (chmin(dp[S][cur], val)) pq.emplace(-val, S, cur);
    };

    while (not pq.empty()) {
        auto [val, S, cur] = pq.top();
        pq.pop();
        val *= -1;
        if (dp[S][cur] != val) continue;
        for (int i = 0; i < 2; i++) {
            for (int j = 0; j < 2; j++) {
                int nxt = cur ^ (1 << (2 * i + j)), nS = S | 1 << nxt, nval = val + a[0];
                update(nS, nxt, nval);
            }
        }
        for (int i = 0; i < 2; i++) {
            {
                int nxt = cur ^ (1 << (2 * i)) ^ (1 << (2 * i + 1)), nS = S | 1 << nxt, nval = val + a[1];
                update(nS, nxt, nval);
            }
            {
                int nxt = cur ^ (1 << i) ^ (1 << (2 + i)), nS = S | 1 << nxt, nval = val + a[2];
                update(nS, nxt, nval);
            }
        }
        {
            int nxt = cur ^ 15, nS = S | 1 << nxt, nval = val + a[3];
            update(nS, nxt, nval);
        }
    }
    vector<int> DP(1 << MAX_STATE, INF);
    for (int S = 0; S < 1 << MAX_STATE; S++) {
        for (int i = 0; i < MAX_STATE; i++) {
            chmin(DP[S], dp[S][i]);
        }
    }
    for (int S = 0; S < 1 << MAX_STATE; S++) {
        for (int i = 0; i < MAX_STATE; i++) {
            if (~S >> i & 1) {
                chmin(DP[S], DP[S | 1 << i]);
            }
        }
    }

    for (; T--;) {
        int m;
        cin >> m;
        int rest = 0;
        for (; m--;) {
            int S = 0;
            for (int i = 0; i < 2; i++) {
                for (int j = 0; j < 2; j++) {
                    char c;
                    cin >> c;
                    if (c == '0') S |= 1 << (2 * i + j);
                }
            }
            rest |= 1 << S;
        }
        cout << DP[rest] << "\n";
    }
    return 0;
}