1 //CF 311E
 2 #include<vector>
 3 #include<cstdio>
 4 #include<cstring>
 5 #include<cstdlib>
 6 #include<iostream>
 7 #include<algorithm>
 8 #define rep(i,n) for(int i=0;i<n;++i)
 9 #define F(i,j,n) for(int i=j;i<=n;++i)
10 #define D(i,j,n) for(int i=j;i>=n;--i)
11 #define pb push_back
12 using namespace std;
13 inline int getint(){
14     int v=0,sign=1; char ch=getchar();
15     while(ch<‘0‘||ch>‘9‘){ if (ch==‘-‘) sign=-1; ch=getchar();}
16     while(ch>=‘0‘&&ch<=‘9‘){ v=v*10+ch-‘0‘; ch=getchar();}
17     return v*sign;
18 }
19 const int N=1e6+10,M=400020,INF=~0u>>2;
20 typedef long long LL;
21 /******************tamplate*********************/
22 int n,m,g,tot,ans;
23 int a[N],v[N];
24 struct edge{int to,v;};
25 struct Net{
26     edge E[M];
27     int head[N],next[M],cnt;
28     void ins(int x,int y,int v){
29         E[++cnt]=(edge){y,v};
30         next[cnt]=head[x]; head[x]=cnt;
31     }
32     void add(int x,int y,int v){
33         ins(x,y,v); ins(y,x,0);
34     }
35     int S,T,cur[N],d[N],Q[N];
36     bool mklevel(){
37         memset(d,-1,sizeof d);
38         d[S]=0;
39         int l=0,r=-1;
40         Q[++r]=S;
41         while(l<=r){
42             int x=Q[l++];
43             for(int i=head[x];i;i=next[i])
44                 if (d[E[i].to]==-1 && E[i].v){
45                     d[E[i].to]=d[x]+1;
46                     Q[++r]=E[i].to;
47                 }
48         }
49         return d[T]!=-1;
50     }
51     int dfs(int x,int a){
52         if (x==T) return a;
53         int flow=0;
54         for(int &i=cur[x];i && flow<a;i=next[i])
55             if (E[i].v && d[E[i].to]==d[x]+1){
56                 int f=dfs(E[i].to,min(a-flow,E[i].v));
57                 E[i].v-=f;
58                 E[i^1].v+=f;
59                 flow+=f;
60             }
61         if (!flow) d[x]=-1;
62         return flow;
63     }
64     void Dinic(){
65         while(mklevel()){ 
66             F(i,S,T) cur[i]=head[i];
67             ans+=dfs(S,INF);
68         }
69     }
70     void init(){
71         n=getint(); m=getint(); g=getint();
72         F(i,1,n) a[i]=getint();
73         F(i,1,n) v[i]=getint();
74         cnt=1; S=0; T=n+m+1; ans=tot=0;
75         F(i,1,n) if(a[i]) add(S,i,v[i]);else add(i,T,v[i]);
76         F(i,1,m){
77             int x=getint(), w=getint(), k=getint(); tot+=w;
78             F(j,1,k){
79                 int y=getint();
80                 if (!x) add(y,n+i,INF);
81                 else add(n+i,y,INF);
82             }
83             int y=getint();
84             if(y) w+=g;//if friend
85             if (!x) add(n+i,T,w);
86             else add(S,n+i,w);
87         }
88     }
89 }G1;
90 
91 int main(){
92 #ifndef ONLINE_JUDGE
93     freopen("311E.in","r",stdin);
94     freopen("311E.out","w",stdout);
95 #endif
96     G1.init(); G1.Dinic();
97     printf("%d\n",tot-ans);
98     return 0;
99 }