#include <bits/stdc++.h>

using namespace std;
ifstream f("aprindere.in");
ofstream g("aprindere.out");
int A[1001], x, K, room, N ,M;
set <int> B[1001];
int T[1001];
int main() {
    f >> N >> M;
    for (int i = 0; i < N; ++i)
        f >> A[i];
    for (int i = 0; i < M; ++i) {
        f >> room;
        f >> T[room];
        f >> K;
        for (int j = 0; j < K; ++j) {
            f >> x;
            B[room].insert(x);
        }
    }
    int sol = 0;
    for (int i = 0; i < N; ++i) {
        if (A[i] == 0) {
            A[i] = 1;
            sol += T[i];
            for (auto x : B[i])
                A[x] = 1 - A[x];
        }
    }
    g << sol;
    return 0;
}