#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i32 = int;
using i64 = long long;
using i128=__int128;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    i32 t=1;
    vector<i32> a(4);
    cin>>t;
    for(auto &i:a) cin>>i;
    vector<i32> f(16);
    f[0]=min({4*a[0],2*a[1],2*a[2],a[3]});
    f[15]=2*min({a[0],a[1],a[2],a[3]});
    for(i32 i=1;i<16;i*=2) f[15-i]=a[0],f[i]=min({3*a[0],a[0]+a[1],a[0]+a[2],a[0]+a[3]});
    f[3]=min(a[1],2*a[0]);f[12]=f[3];
    f[5]=min(a[2],2*a[0]);f[10]=f[5];
    f[6]=min(a[0]+a[0],a[1]+a[2]);f[9]=f[6];
    auto solve=[&]()->void
    {
        i32 n;cin>>n;
        vector<i32> g;
        while(n--)
        {
            string s1,s2;cin>>s1>>s2;
            i32 t=0;
            t+=(s1[0]-'0')*1+(s1[1]-'0')*2;
            t+=(s2[0]-'0')*4+(s2[1]-'0')*8;
            g.push_back(t);
        }
        i32 sum=0;
        while(!g.empty())
        {
            //for(auto it:g) cout<<it<<' ';
            //cout<<'\n';
            i32 pos=0;
            for(i32 i=1;i<(i32)g.size();++i)
            {
                if(f[g[i]]<f[g[pos]]) pos=i;
            }
            sum+=f[g[pos]];
            vector<i32> h;
            for(i32 i=0;i<(i32)g.size();++i) if(pos!=i) h.push_back(g[i]^(15^g[pos]));
            g.clear();g=h;
            //cout<<sum<<'\n';
        }
        cout<<sum<<'\n';
    };
    while(t--) solve();
}