#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#define ll long long

using namespace std;

const int NMAX = 1000;

int n, m, answer;
int bec[NMAX + 1];
int where[NMAX + 1];

int main()
{
    cin >> n >> m;
    for(int i = 0; i < n; i++)
        cin >> bec[i];

    for(int i = 1; i <= m; i++)
    {
        int c, t, nr;
        cin >> c >> t >> nr;
        for(int j = 1; j <= nr; j++)
            cin >> where[j];

        if(!bec[c])
        {
            for(int j = 1; j <= nr; j++)
                bec[where[j]] = !bec[where[j]];
            answer += t;
        }
    }

    cout << answer << '\n';
    return 0;
}