#include <bits/stdc++.h>
using namespace std;
const int MAXN = 12100;
const int INF = 1000000000;
struct edge {
  int a, b, cap, flow;
};
int n, s, t, d[MAXN], ptr[MAXN], q[MAXN];
vector<edge> e;
vector<int> g[MAXN];
void add_edge(int a, int b, int cap) {
  edge e1 = {a, b, cap, 0};
  edge e2 = {b, a, 0, 0};
  g[a].push_back((int)e.size());
  e.push_back(e1);
  g[b].push_back((int)e.size());
  e.push_back(e2);
}
bool bfs() {
  int qh = 0, qt = 0;
  q[qt++] = s;
  memset(d, -1, n * sizeof d[0]);
  d[s] = 0;
  while (qh < qt && d[t] == -1) {
    int v = q[qh++];
    for (size_t i = 0; i < g[v].size(); ++i) {
      int id = g[v][i], to = e[id].b;
      if (d[to] == -1 && e[id].flow < e[id].cap) {
        q[qt++] = to;
        d[to] = d[v] + 1;
      }
    }
  }
  return d[t] != -1;
}
int dfs(int v, int flow) {
  if (!flow) return 0;
  if (v == t) return flow;
  for (; ptr[v] < (int)g[v].size(); ++ptr[v]) {
    int id = g[v][ptr[v]], to = e[id].b;
    if (d[to] != d[v] + 1) continue;
    int pushed = dfs(to, min(flow, e[id].cap - e[id].flow));
    if (pushed) {
      e[id].flow += pushed;
      e[id ^ 1].flow -= pushed;
      return pushed;
    }
  }
  return 0;
}
int dinic() {
  int flow = 0;
  for (;;) {
    if (!bfs()) break;
    memset(ptr, 0, n * sizeof ptr[0]);
    while (int pushed = dfs(s, INF)) flow += pushed;
  }
  return flow;
}
int gend[10010];
int V[10010];
int B[2010];
int W[2010];
int inds[2010][10];
int K[2010];
int F[2010];
int main() {
  int N, m, g;
  cin >> N >> m >> g;
  for (int i = 0; i < N; ++i) cin >> gend[i];
  for (int i = 0; i < N; ++i) cin >> V[i];
  for (int i = 0; i < m; ++i) {
    cin >> B[i] >> W[i] >> K[i];
    for (int j = 0; j < K[i]; ++j) cin >> inds[i][j];
    cin >> F[i];
  }
  n = 2 + N + m;
  s = n - 2;
  t = n - 1;
  int S = 0;
  for (int i = 0; i < m; ++i) {
    int cap = W[i];
    if (B[i] == 0)
      add_edge(s, i, cap);
    else
      add_edge(i, t, cap);
    S += cap;
  }
  for (int i = 0; i < m; ++i) {
    if (F[i] == 1) {
      if (B[i] == 0)
        add_edge(s, i, g);
      else
        add_edge(i, t, g);
    }
  }
  for (int i = 0; i < m; ++i) {
    for (int j = 0; j < K[i]; ++j) {
      int ii = inds[i][j] - 1;
      if (B[i] == 0)
        add_edge(i, ii + m, INF);
      else
        add_edge(ii + m, i, INF);
    }
  }
  for (int i = 0; i < N; ++i) {
    int cap = 0;
    if (gend[i] == 0) cap = V[i];
    add_edge(s, i + m, cap);
    cap = 0;
    if (gend[i] == 1) cap = V[i];
    add_edge(i + m, t, cap);
  }
  int res = dinic();
  res = -(res - S);
  cout << res;
  return 0;
}
