#include <algorithm>
#include <numeric>
#include <ctime>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <cassert>
#include <cstring>

using namespace std;
typedef long long LL;
#define FOR(k,a,b) for(LL k(a); k < (b); ++k)
#define FORD(k,a,b) for(int k(a-1); k >= (b); --k)
#define REP(k,a) for(int k=0; k < (a); ++k)
#define ABS(a) ((a)>0?(a):-(a))

int main(int argv, char** argc)
{
	int T,N,M,t1,t2,act;
	scanf("%d",&T);
	int A[20];
	int AA[1<<15];
	int dp[1<<15];
	int pp[1<<15];
	int su,mx;
	vector<pair<int,int> > vm;
	assert(0<T && T<6);
	while(T--)
	{
		scanf("%d",&N);
		assert(0<N && N<16);
		su=0,mx=0;
		REP(i,N)
		{
			scanf("%d",A+i);
			assert(0<A[i] && A[i]<1e6);
			su+=A[i];
		}
		scanf("%d",&M);
		assert(0<=M && M<((1<<N)-1));
		vm.clear();
		vm.resize(M);
		REP(i,M)
		{
			scanf("%d",&t1);
			assert(2<=t1 && t1<=N);
			vm[i].first = t1;
			int& act = vm[i].second;
			REP(j,t1)
			{
				scanf("%d",&t2);
				assert(1<=t2 && t2<=N);
				act|=1<<(t2-1);
			}
		}
		sort(vm.begin(),vm.end());
		sort(A, A+N,greater<int>() );
		memset(pp,0,sizeof pp);
		REP(i,vm.size())
		{
			pp[vm[i].second]=1;
		}
		REP(i,1<<N) if(pp[i])
		{
			REP(j,N) if(!((1<<j)&i))
			{
				t1=(1<<j)|i;
				pp[t1]=2;
			}
		}
		for(int i=0;i<vm.size();)
		{
			if(pp[vm[i].second]>1)
			{
				swap(vm[i],vm.back());
				vm.pop_back();
			}
			else
				++i;
		}
		sort(vm.begin(),vm.end());
		memset(dp,0, sizeof dp);
		int maxMask = (1<<N)-1;
		REP(i,vm.size())
		{
			t1 = vm[i].second;
			t2 = maxMask - t1;
			act = t2;
			while (1) {
				dp[act+t1]=max(dp[act+t1],dp[act]+A[__builtin_popcount(act+t1)-1]);
				act--;
				if(act<0) break;
				act&=t2;
			}
		}
		REP(i,1<<N)
		mx=max(mx,dp[i]);
		printf("%d\n",su-mx);
	}
	return 0;
}