const maxn = 1000;

var f:text;
    n,m,i,j,sol:longint;
    a:array[0..maxn,0..maxn]of integer;
    t,c:array[0..maxn]of longint;

procedure readdata;
var x:longint;
begin
   assign(f,'aprindere.in');
   reset(f);
   readln(f,n,m);
   for i:=0 to n-1 do read(f,c[i]);
   for i:=1 to m do
   begin
      read(f,x,t[x],a[x,0]);
      for j:=1 to a[x,0] do read(f,a[x,j]);
   end;
   close(f);
end;

procedure solve;
begin
   sol:=0;
   for i:=0 to n-1 do
   begin
      if c[i]<>1 then
      begin
         sol:=sol+t[i];
         for j:=1 to a[i,0] do
         begin
            if c[a[i,j]]=1 then c[a[i,j]]:=0
                           else c[a[i,j]]:=1;
         end;
      end;
   end;
end;

procedure writedata;
begin
   assign(f,'aprindere.out');
   rewrite(f);
   writeln(f,sol);
   close(f);
end;

begin
   readdata;
   solve;
   writedata;
end.