#include <bits/stdc++.h>

using namespace std;

using i32 = int32_t;
using i64 = long long;

#define int i64

using vi = vector<int>;
using pii = pair<int,int>;
const int inf = LLONG_MAX / 2;

// 01
// 23

vector<pii> e;

const i32 N = 1 << 4;
const i32 M = 1 << 16;

void init() {
	vi a(4);
	for(auto &i : a) cin >> i;
	e.emplace_back((1 << 0), a[0]);
	e.emplace_back((1 << 1), a[0]);
	e.emplace_back((1 << 2), a[0]);
	e.emplace_back((1 << 3), a[0]);
	e.emplace_back((1 << 0) | (1 << 1), a[1]);
	e.emplace_back((1 << 2) | (1 << 3), a[1]);
	e.emplace_back((1 << 0) | (1 << 2), a[2]);
	e.emplace_back((1 << 1) | (1 << 3), a[2]);
	e.emplace_back(N - 1, a[3]);
}


i32 main(){
	ios::sync_with_stdio(false), cin.tie(nullptr);
	int T;
	cin >> T;
	init();

	vi W(N, inf); // 点亮每一种矩形的最小代价
	W[N - 1] = 0;
	priority_queue<pii,vector<pii>,greater<>> heap;
	heap.emplace(0, N - 1);
	vi vis(N);

	while(not heap.empty()) {
		auto [d, x] = heap.top();
		heap.pop();
		if(vis[x]) continue;
		vis[x] = 1;
		for(int z; auto [y, val] : e) {
			z = x ^ y;
			if(vis[z]) continue;
			if(W[z] <= d + val) continue;
			W[z] = d + val;
			heap.emplace(W[z], z);
		}
	}

	// for(int i = 0; i < N; i ++) {
	// 	cout << bitset<4>(i) << " " << W[i] << "\n";
	// }

	// return 0; 

	vi Val(M, inf);
	vis = vi(M);
	Val[0] = 0;
	heap.emplace(0, 0);

	while(not heap.empty()) {
		auto [d, now] = heap.top();
		// cout << now << " : " << d << "\n";
		heap.pop();
		if(vis[now]) continue;
		vis[now] = 1;
		vi visited, never;
		for(int i = 0; i < 16; i ++) {
			if(now & (1 << i)) visited.push_back(i);
			else never.push_back(i);
		}
		for(auto x : never) {
			int nxt = 0, p = (N - 1) ^ x;
			nxt |= (1 << (x ^ p));
			for(auto y : visited)
				nxt |= (1 << (y ^ p));
			if(vis[nxt]) continue;
			if(Val[nxt] <= d + W[x]) continue;
			Val[nxt] = d + W[x];
			heap.emplace(Val[nxt], nxt);
		}
	}

	while(T --) {
		int m;
		cin >> m;
		vi a(m);
		for(int x1, x2; auto &i : a) {
			cin >> x1 >> x2;
			if(x1 == 10) x1 = 2;
			if(x1 == 11) x1 = 3;
			if(x2 == 10) x2 = 2;
			if(x2 == 11) x2 = 3;
			i = (x1 << 2) | x2;
			// cout << i << " ";
		}
		// cout << "\n";
		int res = inf;
		auto b = a;
		for(auto [y, z] : e) {
			for(int i = 0; i < m; i ++) 
				b[i] = a[i] ^ y;

			for(auto x : b) {
				int p = (N - 1) ^ x;
				int state = 0;
				for(auto i : b) 
					state |= (1 << (i ^ p));
				res = min(res, Val[state] + z + W[x]);
			}
		}
		cout << res << "\n";
	}




	return 0;
}