#define nume "aprindere"

#ifndef INFOARENA
#define fisier "../algorithm solutions/" nume
#define DBG
#else
#define fisier nume
#endif

#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <set>
#include <cassert>
#include <cstring>
#include <map>
#ifdef INFOARENA
#include <tr1/unordered_set>
#include <tr1/unordered_map>
using namespace std::tr1;
#else
#include <unordered_set>
#include <unordered_map>
#endif

using namespace std;

ifstream fin(fisier".in");
ofstream fout(fisier".out");

#ifdef DBG
#define fout cout
#endif

int n,m;
int v[1000];

int main()
{
    fin>>n>>m;
    for(int i = 0; i < n; ++i)
        fin>>v[i];
    int sol = 0;
    while(m--){
        int x,t,nr;
        fin>>x>>t>>nr;
        if(!v[x]){
            sol+=t;
            while(nr--){
                int y;
                fin>>y;
                v[y] = !v[y];
            }
        }
        else while(nr--){
            int y;
            fin>>y;
        }
    }
    fout<<sol<<'\n';
        
    
	return 0;
}