#include<bits/stdc++.h>
using namespace std;
#define itn int
#define tin int
#define nit int
#define longlong long long
typedef long long ll;
typedef unsigned long long ull;
int a1, a2, a3, a4;
int dp[345141][20], n;
void solve() {
	cin >> n;
	int tot = 0;
	for(int i = 1; i <= n; i++) {
		char x1, x2, x3, x4;
		cin >> x1 >> x2 >> x3 >> x4;
		int sum = (x1 - '0') + (x2 - '0') * 2 + (x3 - '0') * 4 + (x4 - '0') * 8;
		tot += (1<<(sum));
	}
	int minx = 1e9; 
	for(int i = 0; i <= 15; i++) {
		minx = min(minx,dp[tot][i]);
	}
	cout << minx << '\n';
}
int cal(int x,int y) {
	if(x != -1) {
		for(int i = 0; i < 4; i++) {
			if(((x & (1<<i)))== 0) {
				if((y & (1<<i)) == 0) {
					y = y + (1<<i);
				}
				else {
					y = y - (1<<i);
				}
			}
		}
	}
		int cnt = 0;
		for(int i = 0;i < 4; i++) {
			if(y & (1<<i))
			cnt++;
		}
		if(cnt == 0) return a4;
		if(cnt == 4) return a4 * 2;
		if(cnt == 1) return min(min(a2, a3) * 2 + a1, a1 + a4);
		if(cnt == 3) return a1;
		if(y == 3 || y == 12) return a2;
		if(y == 5 || y == 10) return a3;
		return min(2 * a1, a2 + a3);
	
	
}
int h[1145141];
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);cout.tie(0);
	int T;
	cin >> T >> a1 >> a2 >> a3 >> a4;
	a2 = min(a2, 2 * a1);
	a3 = min(a3, 2 * a1);
	a4 = min(min(a2 * 2, a3 * 2), a4);
	for(int i = 0;i <= (1<<17); i++) {
		for(int j = 0; j <= 15; j++) {
			dp[i][j]=1e9;
		}
	}
	queue<int> q;
	for(int i = 0; i <= 15 ; i++) {
		dp[(1<<i)][i] = cal(-1, i);
		for(int j = 0; j <= 15 ; j++) {
			if(i != j) {
				dp[(1<<i) + (1<<j)][j] = dp[(1<<i)][i] + cal(i, j);
				if(h[(1<<i) + (1<<j)] == 0)
				{
					h[(1<<i) + (1<<j)] = 1;
					q.push(((1<<i) + (1<<j)));	
				}
			}
		}
	}
	while(q.size())
	{
		int r = q.front();
	//	cout<<r<<endl;
		q.pop();
		for(int i = 0; i <= 15; i++) {
			if(r & (1<<i)) {
				continue;
			}
			int e = r + (1<<i);
			if(h[e] == 0) {
				h[e] = 1;
				q.push(e);
			}
			for(int j = 0; j <= 15; j++) {
				if(r & (1<<j))
				{
					dp[e][i] = min(dp[e][i], dp[r][j] + cal(j, i));
				}
			}
		}
	}
/*	cout<<-2<<dp[2][1]<<endl;
	cout<<-1<<dp[6][1]<<' '<<dp[6][2]<<' '<<dp[6][3]<<' '<<dp[6][4]<<' '<<dp[6][5]<<endl;*/
	while(T--) {
		solve();
	}
	return 0;
}