#include<cstdio>

#include<cstring>

#include<vector>

#include<queue>

#include<iostream>

using namespace std;

const int N = 555;

inline int in(int x=0,char ch=getchar()){ while(ch>'9' || ch<'0') ch=getchar();

	while(ch>='0' && ch<='9') x=x*10+ch-'0',ch=getchar();return x; }

struct NetWork{

	struct Edge{ int fr,to,flow; };

	vector<Edge> edge;

	vector<int> g[N];

	int p[N],cur[N],d[N],a[N],aa[N],w[N];

	int s,t,m,n,k,flow,cp;

	void Add_Edge(int fr,int to,int fl){

		edge.push_back((Edge){ fr,to,fl }),edge.push_back((Edge){ to,fr,0 });

		m=edge.size(),g[fr].push_back(m-2),g[to].push_back(m-1);

	}

	int BFS(){

		memset(d,0,sizeof(d));d[s]=1;

		queue<int> q;q.push(s);

		for(int x;!q.empty();){

			x=q.front(),q.pop();

			for(int i=0,v;i<g[x].size();i++) if(!d[v=edge[g[x][i]].to] && edge[g[x][i]].flow>0)

				d[v]=d[x]+1,q.push(v);

		}return d[t]>0;

	}

	int Dinic(){

		flow=0;

		for(int x,k,mine,minf;BFS();){

			for(memset(cur,0,sizeof(cur)),k=0,x=s;;){

				if(x==t){

					mine=-1,minf=0x7fffffff;

					for(int i=0;i<k;i++) if(edge[p[i]].flow < minf) minf=edge[p[i]].flow,mine=i;

					for(int i=0;i<k;i++) edge[p[i]].flow-=minf,edge[p[i]^1].flow+=minf;

					k=mine,flow+=minf,x=edge[p[mine]].fr;

				}

				for(int &i=cur[x];i<g[x].size();i++){

					Edge &e=edge[g[x][i]];

					if(e.flow>0 && d[x]+1==d[e.to]) break;

				}

				if(cur[x]<g[x].size()){

					p[k]=g[x][cur[x]],x=edge[p[k++]].to;

				}else{

					if(!k) break;

					d[x]=-1,x=edge[p[--k]].fr;

				}

			}

		}return flow;

	}

	void init(){

		n=in(),k=in();

		s=n+k+1,t=s+1;

		for(int i=1,x;i<=n;i++) x=in(),Add_Edge(s,i,x),Add_Edge(i,t,1);

		for(int i=1,x,y;i<=k;i++){

			x=in();

			for(int j=1,tmp;j<=x;j++) tmp=in(),Add_Edge(tmp,n+i,1);

			y=in();

			for(int j=1,tmp;j<=y;j++) tmp=in(),Add_Edge(n+i,tmp,1);

		}

		cout<<Dinic()<<endl;

	}

}sol;

int main(){

	sol.init();

	return 0;

}