#include <iostream>
#include <fstream>
using namespace std;
ifstream in("aprindere.in");
ofstream out("aprindere.out");
const int maxn = 1005;
int rez[maxn][maxn];
int v[maxn];
int main()
{
    int n, m;
    in >> n >> m;
    for(int i = 0; i < n; i++)
    {
        in >> v[i];
        if(v[i] == 0)
            v[i]--;
    }
    for(int i = 1; i <= m; i++)
    {
        int c, t, nr;
        in >> c >> t >> nr;
        rez[c][0] = t;
        rez[c][1] = nr;
        for(int j = 1; j <= nr; j++)
            in >> rez[c][j+1];
    }
    int s = 0;
    for(int i = 0; i < n; i++)
    {
        if(v[i] == -1)
        {
            s = s + rez[i][0];
            for (int j = 2; j <= rez[i][1] + 1; j++)
                v[rez[i][j]] = v[rez[i][j]] * (-1);
        }
    }
    out << s;
    return 0;
}