#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define int long long
unordered_map<string, int> mp;
unordered_map<int, string> mp1;
const int N = 17, M = 10 + 1;
int a[30];
int t, a0, a1, a2, a3;
int dist[1ll<<16];
bool vis[1ll<<16];

void sol() {
    int m;
    cin >> m;

    vector<string>s(m);
    int state=0;
    for (int i = 0; i < m; i++) {
        string p;
        cin >> s[i] >> p;
        s[i] += p;
        state|=(1ll<<mp[s[i]]); 
    }
    
  //  cout<<state<<'\n';
     auto upd = [&](string& p, int i) -> void {
        int x = 1 - (p[i] - '0');
        p[i] = (char)(x + '0');
    };

    auto tr = [&](const string& s, int op) -> string { 
            if(op<=4){
                string p=s;
                upd(p,op-1);
                return p;
            }else if(op==5||op==6){
                if(op==5){
                    string p = s;
                    upd(p, 0), upd(p, 1); 
                    return p;
                }else if(op==6){
                    string p = s;
                    upd(p, 1), upd(p, 0); 
                    return p;
                }
            }else if(op==7||op==8){
                if(op==7){
                    string p = s;
                    upd(p, 3), upd(p, 1); 
                    return p;
                }else{
                    string p = s;
                    upd(p, 0), upd(p, 2); 
                    return p;
                }
            }else if(op==9){
                string p = s;
                upd(p, 2), upd(p, 1);  
                upd(p, 0), upd(p, 3);
                return p;
            }
               
    };


    if(state>>15&1){
        int ans=1e18;
          for(int i=1;i<=9;i++){
            int k=0;
            for(int j=0;j<=15;j++){
                if(1ll&(state>>j)){
                    string xx=tr(mp1[j],i);
                    int numnum=mp[xx];
                    k|=(1ll<<numnum);
                }
            }
            if(k>>15&1){
                k^=(1ll<<15);
            }
            ans=min(ans,a[i]+dist[k]);
        }
        cout<<ans<<'\n';

    }else{
        cout<<dist[state]<<'\n';
    }
}

struct node{
    int state;
    int cost;
    bool operator < (const node other)const{
        return cost>other.cost;
    }
};

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    
    cin >> t >> a0 >> a1 >> a2 >> a3;
    a1 = min(a1, 2 * a0);
    a2 = min(a2, 2 * a0);
    a3 = min({a3, 4 * a0, 2 * a1, 2 * a2});
    a[1]=a[2]=a[3]=a[4]=a0;
    a[5]=a[6]=a1;
    a[7]=a[8]=a2;
    a[9]=a3;
    for (int i = 0; i < 16; i++) {
        int x = i;
        string s = "";
        for (int j = 0; j < 4; j++) {
            s += (char)(x % 2 + '0');
            x /= 2;
        }
        reverse(s.begin(), s.end());
        mp[s] = i; 
        mp1[i] = s;
    }

    auto upd = [&](string& p, int i) -> void {
        int x = 1 - (p[i] - '0');
        p[i] = (char)(x + '0');
    };

    auto tr = [&](const string& s, int op) -> string { 
            if(op<=4){
                string p=s;
                upd(p,op-1);
                return p;
            }else if(op==5||op==6){
                if(op==5){
                    string p = s;
                    upd(p, 0), upd(p, 1); 
                    return p;
                }else if(op==6){
                    string p = s;
                    upd(p, 1), upd(p, 0); 
                    return p;
                }
            }else if(op==7||op==8){
                if(op==7){
                    string p = s;
                    upd(p, 3), upd(p, 1); 
                    return p;
                }else{
                    string p = s;
                    upd(p, 0), upd(p, 2); 
                    return p;
                }
            }else if(op==9){
                string p = s;
                upd(p, 2), upd(p, 1);  
                upd(p, 0), upd(p, 3);
                return p;
            }
               
    };

    string s = "1111";
    
    memset(dist,0x3f3f3f3f,sizeof dist);
    dist[0]=0;
    priority_queue<node>tp;
    tp.push({0,0});
    while(tp.size()){
        auto [state,cost]=tp.top();
        tp.pop();

        

        if(vis[state]){
            continue;
        }
        vis[state]=true;
        for(int i=1;i<=9;i++){
            int k=0;
            for(int j=0;j<15;j++){
                if(1ll&(state>>j)){
                    string xx=tr(mp1[j],i);
                    int numnum=mp[xx];
                    k|=(1ll<<numnum);
                }
            }
            if(k>>15&1){
                k^=(1ll<<15);
            }
            if(dist[k]>dist[state]+a[i]){
                
                dist[k]=dist[state]+a[i];
                tp.push({k,dist[k]});
            }
            string p="1111";
            k|=(1ll<<mp[tr(p,i)]);
            if(k>>15&1){
                k^=(1ll<<15);
            }
            if(dist[k]>dist[state]+a[i]){

                dist[k]=dist[state]+a[i];
                tp.push({k,dist[k]});
            }
        }
        
    }
    while(t--) {
        sol();
    }

    return 0;
}