#include <iostream>
#include <fstream>
#include <bitset>
#define N 1000
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
int n, m, x, c, t, nr;
long long tt;
bitset<N+1> b;
int main(){
    in>>n>>m;
    for(int i=0; i<n; i++)in>>x,b[i]=x;
    for(int i=1; i<=m; i++){
        in>>c>>t>>nr;
        if(!b[c]){
            tt+=t;
            for(int j=1; j<=nr; j++)in>>x, b[x]=b[x]^1;
        }else{
            for(int j=1; j<=nr; j++)in>>x;
        }
    }
    out<<tt;
    return 0;
}