#include <cstdio>

#include <cstring>

#include <iostream>

#include <algorithm>

using namespace std;

#define maxn 105

#define maxm 1005

#define maxque 200005

#define INF 0x7fffffff

int n,m,val[maxm],last[maxm],head[maxn],s,t,deep[maxn];

int E[maxque],V[maxque],F[maxque],cnt=,ans,que[maxque];

inline void in(int &now)

{

    char Cget=getchar();now=;

    while(Cget>''||Cget<'') Cget=getchar();

    while(Cget>=''&&Cget<='')

    {

        now=now*+Cget-'';

        Cget=getchar();

    }

}

inline void edge_add(int u,int v,int f)

{

    E[++cnt]=head[u],V[cnt]=v,F[cnt]=f,head[u]=cnt;

    E[++cnt]=head[v],V[cnt]=u,F[cnt]=,head[v]=cnt;

}

inline int min(const int &tops_,const int &tops__)

{

    if(tops_<tops__) return tops_;

    else return tops__;

}

inline bool bfs()

{

    for(int i=s;i<=t;i++) deep[i]=-;

    int h=,tail=,now;que[h]=s,deep[s]=;

    for(;h<tail;)

    {

        now=que[h++];

        for(int i=head[now];i;i=E[i])

        {

            if(deep[V[i]]<&&F[i])

            {

                deep[V[i]]=deep[now]+;

                if(V[i]==t) return true;

                que[tail++]=V[i];

            }

        }

    }

    return false;

}

inline int flowing(int now,int flow)

{

    if(now==t||flow<=) return flow;

    int oldflow=,pos;

    for(int i=head[now];i;i=E[i])

    {

        if(deep[V[i]]==deep[now]+&&F[i])

        {

            pos=flowing(V[i],min(flow,F[i]));

            flow-=pos,oldflow+=pos,F[i]-=pos,F[i^]+=pos;

            if(!flow) return oldflow;

        }

    }

    if(!oldflow) deep[now]=-;

    return oldflow;

}

int main()

{

    in(m),in(n),t=n+;

    for(int i=;i<=m;i++) in(val[i]);

    for(int i=;i<=n;i++)

    {

        int pos=,now=,num=;in(num);

        for(int j=;j<=num;j++)

        {

            in(pos);

            if(!last[pos]) last[pos]=i,now+=val[pos];

            else edge_add(last[pos],i,INF),last[pos]=i;

        }

        in(pos),edge_add(i,t,pos);

        if(now) edge_add(s,i,now);

    }

    while(bfs()) ans+=flowing(s,INF);

    printf("%d\n",ans);

    return ;

}