#include <fstream>
#include <vector>

using namespace std;

const int MAX_N = 1e3;
int a[MAX_N + 1], t[MAX_N + 1];
vector<int> v[MAX_N + 1];

int main() {
    ifstream fin("aprindere.in");
    ofstream fout("aprindere.out");
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        fin >> a[i];
    }
    long long answer = 0;
    for (int i = 1; i <= m; i++) {
        int c, nr;
        fin >> c;
        c++;
        fin >> t[c] >> nr;
        for (int j = 1; j <= nr; j++) {
            int x;
            fin >> x;
            v[c].push_back(x + 1);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (t[i] > 0 && a[i] == 0) {
            // a[i] ^= 1;
            answer += t[i];
            for (int j : v[i]) {
                a[j] ^= 1;
            }
        }
    }
    fout << answer;
    return 0;
}