#include<bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(int i=(a),i##_end=(b);i<=i##_end;++i)
#define dep(i,a,b) for(int i=(a),i##_end=(b);i>=i##_end;--i)
using namespace std;
template<class T>inline T mymin(T x,T y){return x<y?x:y;}
template<class T>inline T mymax(T x,T y){return x>y?x:y;}
template <typename T>
inline void read(T &X){
    X=0;int w=0; char ch=0;
    while(!isdigit(ch)) {w|=ch=='-';ch=getchar();}
    while(isdigit(ch)) X=X*10+(ch^48),ch=getchar();
    if(w) X=-X;
}
const int maxn = 4e5 + 5;
//const double pi = acos(-1.0);
//const double eps = 1e-9;
//const int mo = 1e9 + 7;
int n,m,k;
int a[maxn],c[maxn],d[maxn];
int ans,tmp,cnt;
int flag;
char s[10][10];
bool ok[maxn][16];
int dp[maxn][16];
int jh[] = {1,2,4,8,3,12,5,10,15};
int w[] = {0,0,0,0,1,1,2,2,3};
queue<pair<int,int>>q;
int dfs(int i,int j){
	if(ok[i][j]) return dp[i][j];
	ok[i][j] = 1;
	int ans = inf;
	rep(l,0,8){
		int nj = j ^ jh[l],ni;
		ni = i;
		if(ni >> nj & 1) ni ^= (1 << nj);
		ans = mymin(ans,a[w[l]] + dfs(ni,nj));
	}
	rep(l,0,8){
		int nj = j ^ jh[l],ni;
		ni = i;
		if(ni >> nj & 1) ni ^= (1 << nj);
		dp[ni][nj] = mymin(dp[ni][nj],a[w[l]] + dp[i][j]);
	}
	return dp[i][j] = mymin(dp[i][j],ans);
}
void solve(){
	read(n);
	m = (1 << n) - 1;
	int zt = 0;
	rep(i,0,n - 1){
		rep(j,0,1){
			scanf("%s",s[j]);
		}
		c[i] = (s[0][0] & 1) | ((s[0][1] & 1) << 1) | ((s[1][0] & 1) << 2) | ((s[1][1] & 1) << 3);
		c[i] ^= 15;
		zt ^= (1 << c[i]);
	}
	printf("%d\n",dp[zt][0]);
}
int main(){
    //cin.tie(0)->sync_with_stdio(false);
    int T=1,cas=1;
    read(T);
	rep(i,0,(1 << 16) - 1) rep(j,0,15) {
		dp[i][j] = inf;
		ok[i][j] = 0;
	}
	rep(j,0,15) {
		dp[0][j] = 0;
		ok[0][j] = 1;
	}
	rep(i,0,3) read(a[i]);
	rep(i,0,(1 << 16) - 1) rep(j,0,15)if(!ok[i][j]){
		dfs(i,j);
	}
    while(T--) solve();
    return 0;
}