#include <bits/stdc++.h>
using namespace std;
//#define ll long long
#define int long long
#define PII pair<int, int>
//constexpr ll P = 998244353;
//const int N = 1e5, MOD = 1;


void solve() {
    int T;
    cin >> T;
    vector<int> a(4);
    for (int i = 0; i < 4; ++i) cin >> a[i];
    vector<PII> op;
    //01
    //23
    op.push_back({1, a[0]});
    op.push_back({1 << 1, a[0]});
    op.push_back({1 << 2, a[0]});
    op.push_back({1 << 3, a[0]});
    op.push_back({3, a[1]});
    op.push_back({(1 << 3) | (1 << 2), a[1]});
    op.push_back({1 | (1 << 2), a[2]});
    op.push_back({(1 << 1) | (1 << 3), a[2]});
    op.push_back({(1 << 4) - 1, a[3]});
    vector<int> to1(1 << 4, INT32_MAX);
    vector<int> st(1 << 4);
    int N = (1 << 4) - 1;
    to1[N] = 0;
    priority_queue<PII, vector<PII>, greater<PII> > q;
    q.push({to1[N], N});
    while (q.size()) {
        auto [dis, sta] = q.top();
        q.pop();
        if (st[sta]) continue;
        st[sta] = 1;
        for (auto [did, cost]: op) {
            int now = sta ^ did;
            if (st[now]) continue;
            if (to1[now] > dis + cost) {
                to1[now] = dis + cost;
                q.push({to1[now], now});
            }
        }
    }
    int M = (1 << 16) - 1;
    vector<int> vis(M + 1), val(M + 1, INT32_MAX);
    val[0] = 0;
    q.push({val[0], 0});
    while (q.size()) {
        auto [va, sta] = q.top();
        q.pop();
        if (vis[sta]) continue;
        vis[sta] = 1;
        vector<int> is, no;
        for (int i = 0; i < 16; ++i) {
            if ((sta >> i) & 1) is.push_back(i);
            else no.push_back(i);
        }
        for (auto x: no) {
            int p = x ^ N;
            int now = 1 << (x ^ p);
            for (auto y: is) {
                now |= 1 << (y ^ p);
            }
            if (vis[now]) continue;
            if (val[now] > va + to1[x]) {
                val[now] = va + to1[x];
                q.push({val[now], now});
            }
        }
    }
    while (T --) {
        int m;
        cin >> m;
        vector<int> a(m);
        for (int i = 0; i < m; ++i) {
            int x, y;
            cin >> x >> y;
            if (x == 11) x = 3;
            if (y == 11) y = 3;
            a.push_back((x << 2) | y);
        }
        int res = INT32_MAX;
        for (auto [x, y]: op) {
            auto b = a;
            for (auto& v: b) {
                v ^= x;
            }
            for (auto v: b) {
                int p = v ^ N, sta = 0;
                for (auto u: b) {
                    sta |= (1 << (u ^ p));
                }
                res = min(res, val[sta] + y + to1[v]);
            }
        }
        cout << res << '\n';
    }
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;

//    cin >> t;

    while (t--){
        solve();
    }

    return 0;
}