#include<bits/stdc++.h>
#define int long long
#define Pa pair<int,int>
using namespace std;
const int inf=1e18;
signed main(){
	ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	int T;cin>>T;
    vector<int>a(5);
    for(int i=0;i<4;i++)cin>>a[i];
    vector<array<int,2>>e;
    e.push_back({a[0],1});
    e.push_back({a[0],2});
    e.push_back({a[0],4});
    e.push_back({a[0],8});
    e.push_back({a[1],3});
    e.push_back({a[1],12});
    e.push_back({a[2],10});
    e.push_back({a[2],5});
    e.push_back({a[3],15});
    int mx=16;
    vector<int>dis(mx+1,inf),vis(1<<(mx+1),0);
    dis[15]=0;
    priority_queue<array<int,2>,vector<array<int,2>>,greater<array<int,2>>>q;
    q.push({dis[15],15});
    while(!q.empty()){
        auto [_,u]=q.top();q.pop();
        if(vis[u])continue;
        vis[u]=1;
        for(auto[val,nxt]:e){
            int v=u^nxt;
            if(dis[v]>dis[u]+val){
                dis[v]=dis[u]+val;
                q.push({dis[v],v});
            }
        }
    }
    dis[15]=inf;
    for(int i=0;i<=15;i++){
        dis[15]=min(dis[15],dis[i]*2ll);
    }
    int mn=inf;
    for(int i=0;i<4;i++)mn=min(mn,2*a[i]);
//    cout<<dis[15]<<' '<<mn<<endl;
    for(int i=0;i<(1ll<<(mx+1));i++)vis[i]=0;
    vector<int>dp(1<<(mx+1),inf),pre(1<<(mx+1),0);
    dp[0]=0;
    q.push({0,0});
    int maxn=0;int id=0;
    while(!q.empty()){
        auto [_,u]=q.top();q.pop();
        if(vis[u])continue;
        vis[u]=1;
        if(dp[u]>maxn){
            maxn=dp[u];
            id=u;
        }
        for(int i=0;i<mx;i++){
            if((u>>i)&1)continue;
            int v=u|(1ll<<i);
            int cur=pre[u]^i;
            if(cur==15&&u!=0){
                if(dp[v]>dp[u]){
                    dp[v]=dp[u];
                    pre[v]=pre[u];
                    q.push({dp[v],v});
                }
            }
            else if(dp[v]>dp[u]+dis[cur]){
                dp[v]=dp[u]+dis[cur];
                pre[v]=pre[u]^(15^cur);
                q.push({dp[v],v});
            }
        }
    }
//    cout<<maxn<<endl;
//    cout<<(1<<mx)-1<<endl;
    for(int i=(1<<mx)-1;i>=0;i--){
        for(int j=i;j;j=(j-1)&i){
            dp[j]=min(dp[j],dp[i]);
        }
    }
    while(T--){
        int n;cin>>n;
        vector<int>b(n);
        int res=0;
        for(int i=0;i<n;i++){
            string s;cin>>s;
            b[i]=(s[0]-'0')*8;
            b[i]+=(s[1]-'0')*4;
            cin>>s;
            b[i]+=(s[0]-'0')*2;
            b[i]+=(s[1]-'0');
            res|=(1ll<<b[i]);
//            cout<<b[i]<<'\n';
        }
        cout<<dp[res]<<'\n';
    }
}