#include <fstream>
#include <algorithm>
using namespace std;

ifstream fin ("aprindere.in");
ofstream fout ("aprindere.out");

const int N = 1005, NR = 105;

struct intrerupator {
    int c, t, nr, in[NR];
} v[N];

bool cmp(intrerupator a, intrerupator b) {
    return a.c < b.c;
}

bool viz[N];
int n, m, sol;

int main() {
    fin >> n >> m;
    for (int i = 0; i < n; ++i)
        fin >> viz[i];
    for (int i = 0; i < m; ++i) {
        fin >> v[i].c >> v[i].t >> v[i].nr;
        for (int j = 0; j < v[i].nr; ++j)
            fin >> v[i].in[j];
    }
    sort (v, v + m, cmp);
    for (int i = 0; i < m; ++i) {
        if (!viz[v[i].c]) {
            sol += v[i].t;
            for (int j = 0; j < v[i].nr; ++j)
                viz[v[i].in[j]] = !viz[v[i].in[j]];
        }
    }
    fout << sol;
}