#include <fstream>
//#include <iostream>
#include <vector>
#include <deque>
#include <limits>
#include <queue>
using namespace std;

const int INF = numeric_limits<int>::max()/2;



int bfs(unsigned sink, const vector<deque<int> > &Adj, vector<vector<int> > &F){
    vector<int> prev(sink+1,-1);
    vector<int> maxim(sink+1,0);

    queue<int> q;
    q.push(0);
    prev[0]=0;
    maxim[0]=INF;

    while(!q.empty()){
        int v=q.front();
        q.pop();

        for(unsigned ng = 0; ng<Adj[v].size(); ++ng){
            unsigned i=Adj[v][ng];
            if(prev[i]==-1 && maxim[i] < min(maxim[v],F[v][i])){
                maxim[i] = min(maxim[v],F[v][i]);

                if(i==sink){
                    prev[i]=v;
                    int p = prev[i];
                    int c = i;
                    while(p!=c){
                        F[p][c]-=maxim[i];
                        F[c][p]+=maxim[i];
                        c=p;
                        p=prev[p];
                    }
                    //cout<<"found a way to your heart...\n";
                    return maxim[sink];
                }
                else{
                    q.push(i);
                    prev[i]=v;
                }
            }
        }
    }
    return 0;
}




inline int flux_maxim(int sink, const vector<deque<int> > &Adj, vector<vector<int> > &F){
    int fm=0;
    int curr;

    while((curr=bfs(sink,Adj,F))!=0){
        fm+=curr;
    }

    return fm;
}



int main()
{
    ifstream fin("tribut.in");
    ofstream fout("tribut.out");

    int t; fin>>t;
    while(t--){
        int n,m;
        fin>>n>>m;

        vector< deque<int> > Adj(n+m+2);
        vector< vector<int> > F(n+m+2,vector<int>(n+m+2,0));

        for(int i=1;i<=n;++i){
            int x; fin>>x;
            Adj[0].push_back(i);
            Adj[i].push_back(0);
            F[0][i]=x;
        }

        vector< bool > apartine(n+1,false);

        for(int j=n+1;j<=n+m;++j){
            int nr; fin>>nr;
            int x; fin>>x;
            F[j][n+m+1]=x;
            Adj[j].push_back(n+m+1);
            Adj[n+m+1].push_back(j);

            for(int k=0;k<nr;++k){
                int o; fin>>o;
                apartine[o]=true;
                Adj[o].push_back(j);
                Adj[j].push_back(o);
                F[o][j]=INF;
            }
        }

        for(int i=1; i<=n; ++i)
            if(!apartine[i]){
                Adj[i].push_back(n+m+1);
                Adj[n+m+1].push_back(i);
                F[i][n+m+1]=INF;
            }

        fout << flux_maxim(n+m+1, Adj,F)<<'\n';
        /*for(int i=0; i<n+m+1; ++i){
            cout<<i<<":\n";
            for(int j=0;j<Adj[i].size(); ++j){
                cout<<"  "<<Adj[i][j]<<" with: fwd:"<<F[i][Adj[i][j]]<<" rev:"<<F[Adj[i][j]][i]<<'\n';
            }
            cout<<endl;
        }*/
    }
}