#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


template <class Flow> struct MaxFlow {
  // Watch out when using types other than int and long long.
  static constexpr Flow FLOW_EPS = 1e-10L;
  static constexpr Flow FLOW_INF = std::numeric_limits<Flow>::max();
  
  int n, m;
  vector<int> ptr, nxt, zu;
  vector<Flow> capa;

  explicit MaxFlow(int n_) : n(n_), m(0), ptr(n_, -1) {}
  void ae(int u, int v, Flow w0, Flow w1 = 0) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    assert(0 <= w0);
    assert(0 <= w1);
    nxt.push_back(ptr[u]); zu.push_back(v); capa.push_back(w0); ptr[u] = m++;
    nxt.push_back(ptr[v]); zu.push_back(u); capa.push_back(w1); ptr[v] = m++;
  }

  vector<int> see, lev, que;

  Flow augment(int u, int t, Flow limFlow) {
    if (u == t) return limFlow;
    for (int &i = see[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
      const int v = zu[i];
      if (lev[u] < lev[v]) {
        const Flow f = augment(v, t, min(limFlow, capa[i]));
        if (f > FLOW_EPS) { capa[i] -= f; capa[i ^ 1] += f; return f; }
      }
    }
    return 0;
  }
  bool bfs(int s, int t) {
    for (int u = 0; u < n; ++u) { see[u] = ptr[u]; lev[u] = -1; }
    auto head = que.begin(), tail = que.begin();
    for (lev[*tail++ = s] = 0; head != tail; ) {
      const int u = *head++;
      for (int i = ptr[u]; ~i; i = nxt[i]) if (capa[i] > FLOW_EPS) {
        const int v = zu[i];
        if (!~lev[v]) {
          lev[*tail++ = v] = lev[u] + 1;
          if (v == t) return true;
        }
      }
    }
    return false;
  }
  Flow run(int s, int t, Flow limFlow = FLOW_INF) {
    see.resize(n); lev.resize(n); que.resize(n);
    Flow flow = 0;
    for (; flow + FLOW_EPS < limFlow && bfs(s, t); ) {
      for (Flow f; (f = augment(s, t, limFlow - flow)) > FLOW_EPS; flow += f) {}
    }
    return flow;
  }
};

////////////////////////////////////////////////////////////////////////////////


/*
  problem
    (C[A[1]], ..., C[A[M]]): basis of (C[1], ..., C[N])
    (C[B[1]], ..., C[B[M]]): basis of (C[1], ..., C[N])
    minimize \sum[u] (w[u] - V[u])^2
    subject to:
    - A: min cost basis
    - B: max cost basis
*/

using u64 = unsigned long long;
constexpr int E = 64;

Int sq(Int w) {
  return w * w;
}

int N, M;
vector<u64> C;
vector<Int> V;
vector<int> A[2];

int main() {
  for (; ~scanf("%d%d", &N, &M); ) {
    C.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%llu", &C[u]);
    }
    V.resize(N);
    for (int u = 0; u < N; ++u) {
      scanf("%lld", &V[u]);
    }
    for (int h = 0; h < 2; ++h) {
      A[h].resize(M);
      for (int i = 0; i < M; ++i) {
        scanf("%d", &A[h][i]);
        --A[h][i];
      }
    }
    
    // w[u] < w[v]
    vector<pair<int, int>> edges;
    for (int h = 0; h < 2; ++h) {
      u64 basis[E] = {}, masks[E] = {};
      for (int i = 0; i < M; ++i) {
        u64 c = C[A[h][i]];
        u64 p = 1ULL << i;
        for (int e = E; --e >= 0; ) if (c >> e & 1) {
          c ^= basis[e];
          p ^= masks[e];
        }
        assert(c);
        const int e = 63 - __builtin_clzll(c);
        basis[e] = c;
        masks[e] = p;
      }
      for (int u = 0; u < N; ++u) {
        u64 c = C[u];
        u64 p = 0;
        for (int e = E; --e >= 0; ) if (c >> e & 1) {
          c ^= basis[e];
          p ^= masks[e];
        }
        assert(!c);
        for (int i = 0; i < M; ++i) if (p >> i & 1) {
          if (A[h][i] != u) {
            if (h == 0) {
              edges.emplace_back(A[h][i], u);
            } else {
              edges.emplace_back(u, A[h][i]);
            }
          }
        }
      }
    }
// cerr<<"edges = "<<edges<<endl;
    
    vector<Int> los(N, *min_element(V.begin(), V.end()));
    vector<Int> his(N, *max_element(V.begin(), V.end()));
    for (; ; ) {
      bool any = false;
      vector<Int> wss[2];
      for (int z = 0; z < 2; ++z) {
        wss[z].resize(N);
      }
      for (int u = 0; u < N; ++u) {
        if (los[u] < his[u]) {
          any = true;
          wss[0][u] = (los[u] + his[u]) / 2;
          wss[1][u] = wss[0][u] + 1;
        } else {
          wss[0][u] = wss[1][u] = los[u];
        }
      }
      if (!any) break;
      // src: wss[0], snk: wss[1]
      MaxFlow<Int> mf(N + 2);
      const int src = N, snk = N + 1;
      for (int u = 0; u < N; ++u) {
        const Int d = sq(wss[1][u] - V[u]) - sq(wss[0][u] - V[u]);
        if (d >= 0) {
          mf.ae(src, u, d);
        } else {
          mf.ae(u, snk, -d);
        }
      }
      for (const auto &e : edges) {
        if (wss[1][e.first] > wss[0][e.second]) {
          mf.ae(e.second, e.first, mf.FLOW_INF);
        }
      }
      mf.run(src, snk);
      for (int u = 0; u < N; ++u) {
        if (~mf.lev[u]) {
          his[u] = wss[0][u];
        } else {
          los[u] = wss[1][u];
        }
      }
// cerr<<"los = "<<los<<", his = "<<his<<endl;
    }
    
    Int ans = 0;
    for (int u = 0; u < N; ++u) {
      ans += sq(los[u] - V[u]);
    }
    printf("%lld\n", ans);
  }
  return 0;
}