#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <algorithm>
#include <queue>

#define BUF_SIZE 1<<17
char buf[BUF_SIZE];
int pbuf=BUF_SIZE;
FILE*fi,*fo;
inline char nextch(){
    if(pbuf==BUF_SIZE){
        fread(buf, BUF_SIZE, 1, fi);
        pbuf=0;
    }
    return buf[pbuf++];
}
inline long long nextnum(){
    long long a=0;
    char c=nextch();
    while((c<'0' || c>'9') && c!='-')
        c=nextch();
    int semn=1;
    if(c=='-'){
        semn=-1;
        c=nextch();
    }
    while('0'<=c && c<='9'){
        a=a*10+c-'0';
        c=nextch();
    }
    return a*semn;
}

#define MAXN 1000
#define MAXM 1000
struct Intrerupator{
    int camera;
    int timp;
    int nr;
    std::vector <int> G;
    bool operator <(const Intrerupator &aux) const{
        return camera<aux.camera;
    }
}w[1+MAXM];
int v[MAXN];

int main(){
    fi=fopen("aprindere.in","r");
    fo=fopen("aprindere.out","w");
    int n=nextnum(), m=nextnum();
    for(int i=0;i<n;i++)
        v[i]=nextnum();
    for(int i=0;i<m;i++){
        w[i].camera=nextnum();
        w[i].timp=nextnum();
        w[i].nr=nextnum();
        for(int j=0;j<w[i].nr;j++)
            w[i].G.push_back(nextnum());
    }
    std::sort(w, w+m);
    int tt=0;
    for(int i=0;i<m;i++)
        if(!v[w[i].camera]){
            tt+=w[i].timp;
            for(int j=0;j<w[i].nr;j++)
                v[w[i].G[j]]=1-v[w[i].G[j]];
        }
    fprintf(fo,"%d", tt);
    fclose(fi);
    fclose(fo);
    return 0;
}