#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
long long n, s, t, dis[100005], vis[100005], head[100005], to[100005],
    v[100005], cur[100005], nx[100005], nex[100005], sum, a[100005], ans,
    tot = 1, k, x, y, m, g, w[100005];
void add(long long x, long long y, long long w, long long f) {
  nex[++tot] = head[x], head[x] = tot, v[tot] = f, nx[tot] = w, to[tot] = y;
}
void ad(long long x, long long y, long long w, long long f) {
  add(x, y, w, f);
  add(y, x, 0, -f);
}
long long spfa(long long x, long long y) {
  memset(dis, 0x3f, sizeof(dis));
  memset(vis, 0, sizeof(vis));
  queue<long long> q;
  q.push(s);
  dis[s] = 0;
  while (!q.empty()) {
    long long u = q.front();
    q.pop();
    vis[u] = 0;
    for (long long i = head[u]; i; i = nex[i]) {
      long long h = to[i];
      if (dis[h] > dis[u] + v[i] && nx[i]) {
        dis[h] = dis[u] + v[i];
        if (!vis[h]) vis[h] = 1, q.push(h);
      }
    }
  }
  return dis[t] <= 1e18;
}
long long dfs(long long x, long long f) {
  if (x == t) return f;
  long long y = f;
  vis[x] = 1;
  for (long long &i = cur[x]; i; i = nex[i]) {
    long long h = to[i];
    if (dis[h] != dis[x] + v[i] || vis[h] || !nx[i]) continue;
    long long d = dfs(h, min(nx[i], y));
    y -= d;
    nx[i] -= d;
    nx[i ^ 1] += d;
    if (!y) break;
  }
  vis[x] = 0;
  return f - y;
}
signed main() {
  cin >> n >> m >> g;
  s = 0;
  t = n + m + 1;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 1; i <= n; i++) {
    cin >> x;
    if (a[i])
      ad(s, i, x, 1);
    else
      ad(i, t, x, 1);
  }
  for (long long i = 1; i <= m; i++) {
    cin >> y >> w[i] >> k;
    sum += w[i];
    while (k--) {
      cin >> x;
      if (y)
        ad(n + i, x, inf, 1);
      else
        ad(x, n + i, inf, 1);
    }
    cin >> x;
    if (y)
      ad(s, n + i, w[i] + x * g, 1);
    else
      ad(n + i, t, w[i] + x * g, 1);
  }
  while (spfa(s, t)) {
    memcpy(cur, head, sizeof(head));
    memset(vis, 0, sizeof(vis));
    ans += dfs(s, inf);
  }
  printf("%d", sum - ans);
}
