#include <fstream>
using namespace std;
int n,m,i,v[1001],t[1001],nr[1001][101],c,ok,p[1001],a[1001],q,j,tc;
long long minim;
int main (){
    ifstream fin ("aprindere.in");
    ofstream fout ("aprindere.out");
    fin>>n>>m;
    for (i=0;i<n;i++)
        fin>>v[i];
    for (i=1;i<=m;i++){
        fin>>c;
        fin>>t[c]>>q;
        for (j=1;j<=q;j++){
            fin>>nr[c][j];
        }
        nr[c][0]=q;
    }
    for (i=0;i<n;i++)
        if (v[i] == 0) {
            minim += t[i];
            for (j=1;j<=nr[ i ][0]; j++)
                v[ nr[i][j] ] = 1 - v[ nr[i][j] ];
        }
    fout<<minim;
}