#include<stdio.h>

const int maxn = 1001;

int cost;
int x[maxn];
int k;
int ca;
int m1;
int m;
int n;
int a[maxn];
int mat[maxn][maxn];
int i;
int j;

int main()
{
	freopen("aprindere.in","r",stdin);
    freopen("aprindere.out","w",stdout);
    scanf("%d %d",&n,&m);
    for( i = 0; i <= n-1; ++i)
    {
        scanf("%d",&a[i]);
    }
    for(i = 1; i <= m; ++i)
    {
        int x1;
    	scanf("%d %d %d",&ca,&x1,&m1);
        x[ca]=x1;
        mat[ca][0] = m1;
        for( j = 1 ; j <= m1 ; ++j)
        {
        	scanf("%d",&k);

            mat[ca][j] = k;
        }

    }
    for(i = 0; i <= n-1; ++i)
    {
    	if (a[i]==0)
        {
            cost += x[i];
            for(j = 1; j <= mat[i][0]; ++j)
            {
                a[mat[i][j]]^=1;
            }
        }

    }
    printf("%d\n",cost);
    return 0;
}