#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
#define lowbit(x) = ((x)& - (x))
#define rep(a,b,c) for(int a=b;a<=c;a++)
#define per(a,b,c) for(int a=b;a>=c;a--)
#define x first
#define y second
using namespace std;
typedef long long ll;
const int N = 18;
char aa;
int t,m,ans = 0;
int a[4],f[16],d[N];
/*bitset<4> g[N];
map<bitset<4>,int> mp;
void make(bitset<4> x,vector<int>& v){
	int d = x.count();
	if(d==0){
		int a0 = 4*a[0],a1 = 2*a[1],a2 = 2*a[2],a3 = a[3];
		int ma = min(a0,max(a1,max(a2,a3)));
		mp[x] = ma;
	}
	if(d==1){
		mp[x] = a[0]+min(a[1],min(a[2],a[3]));
	}
	if(d == 2){
		mp[x] = a[0]
	}
}*/
int make(int x){
	int cnt = 0;int a0 = 4*a[0],a1 = 2*a[1],a2 = 2*a[2],a3 = a[3];
	int ma = min(a0,min(a1,min(a2,a3)));
	rep(i,0,3){
		if(x&(1<<i))++cnt;
	}
	if(cnt==0)return ma;
	if(cnt == 1)return a[0]+min(a[1],min(a[2],a[3]));
	if(cnt == 3)return a[0];
	if(cnt == 2){
		if(((x&1)&&(x&(1<<1)))||((x&(1<<2))&&(x&(1<<3))))return min(2*a[0],a[1]);
		else if(((x&1)&&(x&(1<<2)))||((x&(1<<1))&&(x&(1<<3))))return min(2*a[0],a[2]);
		else return min(2*a[0],a[1]+a[2]);
	}
	if(cnt == 4) return 2*ma;
}
void init(){
	rep(i,0,15)f[i] = make(i);
}
bool cmp(int x,int y){
	return f[x]<f[y];
}
int main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>t;
	rep(i,0,3)cin>>a[i];
	init();
	while(t--){
		ans = 0;
		cin>>m;
		rep(i,1,m){
			d[i] = 0;
			rep(j,0,3){
				cin>>aa;
				//while(aa!='\n')cin>>aa;
				d[i] += (aa-'0')<<j;
			}
		}
		int now = 1;
		while(now<m){
			sort(d+now,d+m+1,cmp);
			ans+=f[d[now]];
			rep(i,now+1,m){
				rep(j,0,3){
					if(!(d[now]&(1<<j))){
						if(d[i]&(1<<j))d[i]-=(1<<j);
						else d[i]+=(1<<j);
					}
				}
			}
			++now;
		}
		ans+=f[d[m]];
		cout<<ans<<'\n';
	}
	return 0;
}