#include<bits/stdc++.h>
using namespace std;
const int mask[9]={8,4,2,1,12,3,10,5,15};
typedef long long ll;
template<typename T>void read(T &x){
    x=0;char c=getchar();bool f=false;
    while(c<'0'||c>'9'){if(c=='-')f=true;c=getchar();}
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^48),c=getchar();
    if(f) x=-x;
}
int a0,a1,a2,a3;
int calc(int x)
{
    assert(x>=0&&x<=8);
    if(x<4)return a0;
    if(x<6)return a1;
    if(x<8)return a2;
    return a3;
}
int m,tar,res;
vector<int>v;
void dfs(int k,int cost,int ok)
{
    if(ok==tar)res=min(res,cost);
    for(int i=0;i<9;i++)
    {
        if((k>>i)&1)continue;
        for(int j=0;j<m;j++)
        {
            v[j]^=mask[i];
            if(v[j]==15)ok^=(1<<j);
        }
        dfs(k|(1<<i),cost+calc(i),ok);
        for(int j=0;j<m;j++)
        {
            if(v[j]==15)ok^=(1<<j);
            v[j]^=mask[i];
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T;
    cin>>T>>a0>>a1>>a2>>a3;
    while(T--)
    {
        cin>>m;
        v.clear();
        for(int i=0;i<m;i++)
        {
            int s1,s2;
            cin>>s1>>s2;
            v.push_back(s1/10*8+s1%10*4+s2/10*2+s2%10);
        }
        if(m==1&&v[0]==15)
        {
            res=min({a0,a1,a2,a3})*2;
            cout<<res<<endl;
            continue;
        }
        tar=(1<<m)-1,res=1e9;
        dfs(0,0,0);
        cout<<res<<endl;
    }
    return 0;
}