#include<bits/stdc++.h>
using namespace std;
int a[4],f[1<<16];
constexpr pair<int,int> sk[]={{1,0},{2,0},{4,0},{8,0},{3,1},{12,1},{5,2},{10,2},{15,3}};
inline void solve(){
	int m=0;int msk=0;
	cin>>m;
	while(m--){
		char a,b,c,d;cin>>a>>b>>c>>d;
		msk|=1<<((a-'0')+(b-'0')*2+(c-'0')*4+(d-'0')*8);
	}
	cout<<f[msk]<<'\n';
}
int main(){
	std::ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	int t;cin>>t>>a[0]>>a[1]>>a[2]>>a[3];
	memset(f,0x3f,sizeof f);
	priority_queue<pair<int,int>> q;q.emplace(0,1<<15);f[1<<15]=0;
	while(!q.empty()){
		auto [dis,p]=q.top();q.pop();dis=-dis;
		if(f[p]!=dis) continue;
		vector<int> v;
		auto upd=[&](int to,int dis){if(f[to]>dis)f[to]=dis,q.emplace(-dis,to);};
		for(int j=0;j<16;j++) if(p>>j&1) v.push_back(j);
		for(auto [ff,y]:sk){
			int to=1<<15;
			for(int x:v) to|=1<<(x^ff);
			upd(to,dis+a[y]);
		}
	}
	for(int i=0;i<16;i++)
	for(int j=0;j<1<<16;j++)if(j>>i&1)f[j^1<<i]=min(f[j^1<<i],f[j]);
	f[1<<15]=2;
	while(t--) solve();
}