/*
TASK: food
LANG: C
*/

#include<stdio.h>

int n,m;
int i,j,k;
int prod,price,max;
int val[100];
int pc[100],nc[100];
int tmp[100];
int dp[100][100];
int sum[100];

int main () {
//    freopen("test.txt","rt",stdin);
    scanf("%d %d",&n,&m);
    for (i=0;i<n;i++)
        scanf("%d",&val[i]);
    for (i=0;i<m;i++) {
        scanf("%d %d",&pc[i],&nc[i]);
        sum[i]=pc[i];
        for (j=0;j<nc[i];j++) {
            scanf("%d",&prod);
            prod--;
            dp[i][prod]=1;
            sum[i]-=val[prod];
            }
        }

    for (i=0;i<m;i++)
        for (j=0;j<i;j++) {
            for (k=0;k<n;k++) tmp[k]=0;
            price=sum[j];
            for (k=0;k<n;k++)
                if ((!dp[j][k])&&dp[i][k]) price-=val[k-1];
            price+=pc[i];
            if (price>sum[i]) {
                              sum[i]=price;
                              for (k=0;k<n;k++)
                                  tmp[k]=dp[j][k];
                              }
            for (k=0;k<n;k++)
                dp[i][k]|=tmp[k];
            }
    max=-75000000;
    for (i=0;i<m;i++)
        if (max<sum[i]) max=sum[i];
    if (max>0) printf("%d\n",max);
    else printf("0\n");
    return 0;
    }
