#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
using namespace std;


const string file = "aprindere";

const string infile = file + ".in";
const string outfile = file + ".out";

const int INF = 0x3f3f3f3f;


int main()
{
#ifdef ONLINE_JUDGE
	ostream &fout = cout;
	istream &fin = cin;
#else
	fstream fout(outfile.c_str(), ios::out);
	fstream fin(infile.c_str(), ios::in);
#endif	
	

	int Sol = 0;

	int N, M;

	fin >> N >> M;

	vector<int> cost;
	vector<vector<int> > affect;
	vector<bool> state;
	affect.resize(N);
	state.resize(N);
	cost.resize(N);

	for(int i = 0; i < N; i++)
	{
		int x;
		fin >> x;
		if( x == 0)
		{
			state[i] = false;
		}
		else
		{
			state[i] = true;
		}
	}

	for(int i = 0; i < M; i++)
	{
		int s, c, cnt;
		fin >> s >> c >> cnt;
		cost[s] = c;

		for(int j = 0; j < cnt; j++)
		{
			int x;
			fin >> x;
			affect[s].push_back(x);
		}
	}

	for(int i = 0; i < N; i++)
	{
		if(state[i] == false)
		{
			Sol += cost[i];

			for(int j = 0; j < affect[i].size(); j++)
			{
				if(state[affect[i][j]] == true)
				{
					state[affect[i][j]] = false;
				}
				else
				{
					state[affect[i][j]] = true;
				}
			}
		}
	}

	fout << Sol << "\n";

#ifdef ONLINE_JUDGE
#else

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