#include <iostream>
using namespace std;
#include <set>
#include <algorithm>
#include <cmath>
#include <map>
#include <cstdio>
#include <string>
#include <cstring>
#include <string.h>
#include <stdlib.h>
#include <iomanip>
#include <fstream>
#include <stdio.h>
#include <stack>
#include <queue>
#include <ctype.h>
#include <vector>
#include <random>
#include <list>
#define ll long long
#define ull unsigned long long
#define pb push_back
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define pii pair<int, int>
#define pli pair<ll, int>
#define pil pair<int, ll>
#define pll pair<ll, ll>
#define lowbit(x) ((x) & (-x))
ll extend_gcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll d = extend_gcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}
ll fastpow(ll a, ll n, ll mod)
{
    ll ans = 1;
    a %= mod;
    while (n)
    {
        if (n & 1)
            ans = (ans * a) % mod; //% mod
        a = (a * a) % mod;         //% mod
        n >>= 1;
    }
    return ans;
}

inline void write(__int128 x)
{
    if (x > 9)
    {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
__int128 sqrt(__int128 m)
{
    __int128 leftt = 0, rightt = ((__int128)1) << 51, ret = -1, mid;
    while (leftt < rightt)
    {
        mid = (leftt + rightt) / 2;
        if (mid * mid > m)
        {
            rightt = mid;
        }
        else
        {
            leftt = mid + 1;
            ret = mid;
        }
    }
    return ret;
}

const double eps = 1e-6;
int sgn(double x)
{
    if (fabs(x) < eps)
    {
        return 0;
    }
    else
        return x < 0 ? -1 : 1;
}

struct Point
{
    double x, y;
    Point()
    {
    }
    Point(double x, double y) : x(x), y(y)
    {
    }
    Point operator+(Point B)
    {
        return Point(x + B.x, y + B.y);
    }
    Point operator-(Point B)
    {
        return Point(x - B.x, y - B.y);
    }
    bool operator==(Point B)
    {
        return sgn(x - B.x) == 0 && sgn(y - B.y) == 0;
    }
    bool operator<(Point B)
    {
        return sgn(x - B.x) < 0 || (sgn(x - B.x) == 0 && sgn(y - B.y) < 0);
    }
};
typedef Point Vector;
double Cross(Vector A, Vector B) // 叉积
{
    return A.x * B.y - A.y * B.x;
}
double Distance(Point A, Point B)
{
    return hypot(A.x - B.x, A.y - B.y);
}
int Convex_hull(Point *p, int n, Point *ch)
{
    n = unique(p, p + n) - p;
    sort(p, p + n);
    int v = 0;

    for (int i = 0; i < n; i++)
    {
        while (v > 1 && sgn(Cross(ch[v - 1] - ch[v - 2], p[i] - ch[v - 1])) <= 0)
        {
            v--;
        }
        ch[v++] = p[i];
    }

    int j = v;

    for (int i = n - 2; i >= 0; i--)
    {
        while (v > j && sgn(Cross(ch[v - 1] - ch[v - 2], p[i] - ch[v - 1])) <= 0)
        {
            v--;
        }
        ch[v++] = p[i];
    }
    if (n > 1)
    {
        v--;
    }
    return v;
}

int kmp(string s, string p)
{
    int ans = 0, lastt = -1;
    int lenp = p.size();
    vector<int> Next(lenp + 3, 0);
    rep(i, 1, lenp - 1)
    {
        int j = Next[i];
        while (j && p[j] != p[i])
        {
            j = Next[j];
        }
        if (p[j] == p[i])
        {
            Next[i + 1] = j + 1;
        }
        else
        {
            Next[i + 1] = 0;
        }
    }
    int lens = s.size();
    int j = 0;
    rep(i, 0, lens - 1)
    {
        while (j && s[i] != p[j])
        {
            j = Next[j];
        }
        if (s[i] == p[j])
        {
            j++;
        }
        if (j == lenp)
        {
            ans++;
        }
    }
    return ans;
}

int dir[4][2] =
    {
        {-1, 0}, {0, 1}, {1, 0}, {0, -1}}; // 左右上下
// int dir[8][2]={
//         {-1, 0}, {0, 1}, {1, 0}, {0, -1},{-1,-1},{-1,1},{1,-1},{1,1}
// };

#define endl '\n' // 交互题请删除本行
const ll inf = 1000000000000000000ll;
const ll mod1 = 998244353ll, P1 = 131, mod2 = 1e9 + 7ll, P2 = 13331;
ll inverse(ll x)
{
    return fastpow(x, mod1 - 2, mod1);
}

const int N = 1e6 + 10, M = 1e2 + 10;

///////////////////////////////////

int tt;
int n;
ll ge, hang, lie, mian;
ll dp[N], cost[M];
int a[3][M][M], num[M];
bool vis[N];
struct node
{
    int zhi;
    ll feiyong;
    node(int _zhi, ll _feiyong)
    {
        zhi = _zhi;
        feiyong = _feiyong;
    }
    bool operator<(const node &b) const
    {
        return feiyong > b.feiyong;
    }
};

///////////////////////////////////

ll count(int i)
{
    ll ans = 0;
    num[i] = 0;
    rep(ii, 1, 2)
    {
        rep(jj, 1, 2)
        {
            num[i] += a[i][ii][jj];
        }
    }
    if (num[i] == 0)
    {
        ans += min({4 * ge, 2 * hang, 2 * lie, mian});
    }
    else if (num[i] == 1)
    {
        ans += min({3 * ge, lie + ge, hang + ge, mian + ge});
    }
    else if (num[i] == 2)
    {
        if (a[i][1][1] && a[i][2][1] || a[i][1][2] && a[i][2][2])
        {
            ans += min(2 * ge, lie);
        }
        else if (a[i][1][1] && a[i][1][2] || a[i][2][1] && a[i][2][2])
        {
            ans += min(2 * ge, hang);
        }
        else
        {
            ans += min(2 * ge, hang + lie);
        }
    }
    else if (num[i] == 3)
    {
        ans += ge;
    }
    return ans;
}

///////////////////////////////////

void init()
{
    rep(i, 0, 15)
    {
        int temp = i;
        per(ii, 1, 2)
        {
            per(jj, 1, 2)
            {
                a[1][ii][jj] = temp % 2;
                temp >>= 1;
            }
        }
        cost[i] = count(1);
    }
    rep(i, 1, (1 << 16))
    {
        dp[i] = inf;
    }
    priority_queue<node> q;
    q.push(node(0, 0));
    while (q.size())
    {
        node u = q.top();
        q.pop();
        if (vis[u.zhi])
        {
            continue;
        }
        vis[u.zhi] = 1;
        ll zhi = u.zhi;
        if (zhi == (1 << 16) - 1)
        {
            continue;
        }
        zhi |= (1 << 15);
        rep(i, 0, 15)
        {
            int nxt = 0;

            rep(j,0,15)
            {
                if( (1<<j)&zhi   )
                {
                    nxt+=(1<<  (j^i)     );
                }
            }

            if (u.feiyong + cost[15-i] < dp[nxt])
            {
                dp[nxt] = u.feiyong + cost[15-i];
                q.push(node(nxt, dp[nxt]));
            }
        }
    }
}

///////////////////////////////////

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0); // 交互题请删除本行
  //  freopen("ain.txt", "r", stdin);
  //  freopen("aout.txt", "w", stdout);

    cin >> tt >> ge >> hang >> lie >> mian;
    init();
    while (tt--)
    {
        cin >> n;
        int zhi = 0;
        rep(i, 1, n)
        {
            string s1, s2;
            cin >> s1 >> s2;
            s1 = s1 + s2;
            int temp = 0;
            for (auto j : s1)
            {
                temp <<= 1;
                if (j == '1')
                {
                    temp++;
                }
            }
            zhi += (1 << temp);
        }
        //
      //  cout << zhi << endl;
        if (zhi == (1 << 15))
        {
            cout << 2 * min({ge, hang, lie, mian}) << endl;
        }
        else
            cout << dp[zhi] << endl;
    }

    return 0;
}