#include <bits/stdc++.h>

using namespace std;

ifstream in("aprindere.in");
ofstream out("aprindere.out");

const int maxN = (int)1e3;

int n, m;

bool state[maxN + 5];

vector<int> g[maxN + 5];

int cost[maxN + 5];

int main() {
  in >> n >> m;
  for (int i = 1; i <= n; i++) {
    in >> state[i];
  }
  for (int i = 1; i <= m; i++) {
    int u, c, k;
    in >> u >> c >> k;
    cost[u + 1] = c;
    for (int j = 1; j <= k; j++) {
      int v;
      in >> v;
      g[u + 1].push_back(v + 1);
    }
  }
  int sum = 0;
  for (int i = 1; i <= n; i++) {
    if (!state[i]) {
      sum += cost[i];
      for (int v : g[i]) {
        state[v] = !state[v];
      }
    }
  }
  out << sum << "\n";
  return 0;
}