#include<cstdio>

 #include<cstring>

 #include<cstdlib>

 #include<cmath>

 #include<algorithm>

 #define N 510000

 #define inf 999999999

 #define qread(x)x=read();

 using namespace std;

 typedef long long LL;

 inline LL read()

 {

     LL f=,x=;char ch;

     while(ch<'' || ch>''){if(ch=='-')f=-;ch=getchar();}

     while(ch>='' && ch<=''){x=x*+ch-'';ch=getchar();}

     return f*x;

 }

 struct node

 {

     int x,y,next,other;

     LL c;

 }a[N*];int len,last[N];

 LL n,m,st,ed,head,tail;

 void ins(int x,int y,LL c)

 {

     int k1,k2;

     k1=++len;

     a[len].x=x;a[len].y=y;a[len].c=c;

     a[len].next=last[x];last[x]=len;

     k2=++len;

     a[len].x=y;a[len].y=x;a[len].c=;

     a[len].next=last[y];last[y]=len;

     a[k1].other=k2;

     a[k2].other=k1;

 }

 int list[N],h[N];

 bool bt_h()

 {

     memset(h,,sizeof(h));h[st]=;

     list[]=st;head=;tail=;

     while(head!=tail)

     {

         int x=list[head];

         for(int k=last[x];k;k=a[k].next)

         {

             int y=a[k].y;

             if(h[y]== && a[k].c>)

             {

                 h[y]=h[x]+;

                 list[tail++]=y;

             }

         }

         head++;

     }

     if(h[ed]>)return true;

     return false;

 }

 int find_flow(int x,LL flow)

 {

     if(x==ed)return flow;

     LL s=,t;

     for(int k=last[x];k;k=a[k].next)

     {

         int y=a[k].y;

         if(h[y]==h[x]+ && a[k].c> && s<flow)

         {

             s+=t=find_flow(y,min(a[k].c,flow-s));

             a[k].c-=t;a[a[k].other].c+=t;

         }

     }

     if(s==)h[x]=;

     return s;

 }

 LL A[],B[],c1[],c2[];

 int main()

 {

     len=;memset(last,,sizeof(last));

     qread(n);

     LL sum=;

     for(int i=;i<=n;i++){qread(A[i]);sum+=A[i];}

     for(int i=;i<=n;i++){qread(B[i]);sum+=B[i];}

     qread(m);st=N-;ed=N-;

     for(int i=;i<=n;i++)

     {

         ins(st,i,A[i]);

         ins(i,ed,B[i]);

     }

     for(int i=;i<=m;i++)

     {

         int k;qread(k);qread(c1[i]);qread(c2[i]);

         sum+=c1[i]+c2[i];ins(st,i+n,c1[i]);ins(i+n+m,ed,c2[i]);

         for(int j=;j<=k;j++)

         {

             int x;qread(x);

             ins(i+n,x,inf);

             ins(x,i+n+m,inf);

         }

     }

     LL ans=;

     while(bt_h())ans+=find_flow(st,inf);

     printf("%lld\n",sum-ans);

     return ;

 }