#include <fstream>
#include <algorithm>

using namespace std;

int N, M;
int C[1002], T[1002], A[1002][1002];
int S[1002], ind[1002];
int result;

bool comp(const int& i1, const int& i2)
{
    return C[i1] < C[i2];
}

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

    fin >> N >> M;
    for (int i = 1; i <= N; ++i)
        fin >> S[i];
    for (int i = 1; i <= M; ++i)
    {
        fin >> C[i] >> T[i] >> A[i][0];

        ++C[i];
        for (int j = 1; j <= A[i][0]; ++j)
        {
            fin >> A[i][j];
            ++A[i][j];
        }
        ind[i] = i;
    }
    sort(ind + 1, ind + M + 1);

    for (int i = 1; i <= M; ++i)
        if (!S[C[ind[i]]])
        {
            result += T[ind[i]];
            for (int j = 1; j <= A[ind[i]][0]; ++j)
                S[A[ind[i]][j]] = !S[A[ind[i]][j]];
        }

    fout << result;

    fin.close();
    fout.close();
}