import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readInt;
      auto A = new int[M];
      auto B = new int[M];
      foreach (i; 0 .. M) {
        A[i] = readInt - 1;
        B[i] = readInt - 1;
      }
      auto C = new long[][](2, N);
      foreach (h; 0 .. 2) foreach (u; 0 .. N) {
        C[h][u] = readLong;
      }
      
      // bipartite?
      {
        auto uf = new int[N << 1];
        uf[] = -1;
        foreach (i; 0 .. M) {
          uf.connect(A[i] << 1, B[i] << 1 | 1);
          uf.connect(A[i] << 1 | 1, B[i] << 1);
        }
        if (uf.root(0) != uf.root(1)) {
          long ans;
          foreach (h; 0 .. 2) {
            long score;
            foreach (u; 0 .. N) {
              score += C[(uf.root(h) == uf.root(u << 1)) ? 1 : 0][u];
            }
            chmax(ans, score);
          }
          writeln(ans);
          continue;
        }
      }
      
      auto graph = new int[][N];
      foreach (i; 0 .. M) {
        graph[A[i]] ~= B[i];
        graph[B[i]] ~= A[i];
      }
      
      long best;
      auto loss = new long[][](2, N);
      foreach (u; 0 .. N) {
        const mx = max(C[0][u], C[1][u]);
        best += mx;
        foreach (h; 0 .. 2) {
          loss[h][u] = mx - C[h][u];
        }
      }
      
      long cost = INF;
      foreach (src; 0 .. N) {
        alias Entry = Tuple!(long, "c", int, "h", int, "u");
        BinaryHeap!(Array!Entry, "a.c > b.c") que;
        auto dist = new long[][](2, N);
        foreach (h; 0 .. 2) {
          dist[h][] = INF;
        }
        que.insert(Entry(dist[0][src] = 0, 0, src));
        for (; !que.empty; ) {
          const c = que.front.c;
          const h = que.front.h;
          const u = que.front.u;
          que.removeFront;
          if (dist[h][u] == c) {
            const hh = h ^ 1;
            foreach (v; graph[u]) {
              if (hh == 1 && src == v) {
                chmin(cost, c);
              } else {
                const cc = c + loss[h][v];
                if (chmin(dist[hh][v], cc)) {
                  que.insert(Entry(cc, hh, v));
                }
              }
            }
          }
        }
      }
      writeln(best - cost);
    }
  } catch (EOFException e) {
  }
}