#include <cstdio>
#include <vector>

using namespace std;

#define Nmax 1024
#define pb push_back

int n, m;
int t[Nmax], sir[Nmax];
vector<int> lv[Nmax];

void citire()
{
    int i, j, a, b, c;
    scanf("%d %d\n", &n, &m);
    for (i=1; i<=n; ++i)
        scanf("%d ", &sir[i]);
    for (i=1; i<=m; ++i)
    {
        scanf("%d %d %d ", &a, &b, &c);
        ++a;
        t[a] = b;
        for (j=1; j<=c; ++j)
        {
            scanf("%d ", &b);
            lv[a].pb(b+1);
        }
    }
}

void solve()
{
    int i, sol = 0;
    vector<int> :: iterator it;
    for (i=1; i<=n; ++i)
        if (!sir[i])
        {
            for (it = lv[i].begin(); it != lv[i].end(); ++it)
                sir[*it] = !sir[*it];
            sol += t[i];
        }
    printf("%d\n", sol);
}

int main()
{
    freopen("aprindere.in", "r", stdin);
    freopen("aprindere.out", "w", stdout);
    citire();
    solve();
    return 0;
}