#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

bool is_bipartite(const std::vector<std::vector<int>>& graph,
                  std::vector<int>* color) {
  const int n = graph.size();
  color->assign(n, -1);
  const std::function<bool(int, int)> dfs = [&graph, &color, &dfs](
      const int ver, const int c) -> bool {
    (*color)[ver] = c;
    for (const int e : graph[ver]) {
      if ((*color)[e] == c || ((*color)[e] == -1 && !dfs(e, c ^ 1))) {
        return false;
      }
    }
    return true;
  };
  for (int i = 0; i < n; ++i) {
    if ((*color)[i] == -1 && !dfs(i, 0)) {
      color->clear();
      return false;
    }
  }
  return true;
}

int main() {
  int n, m; cin >> n >> m;
  vector<vector<int>> graph(n);
  while (m--) {
    int u, v; cin >> u >> v; --u; --v;
    graph[u].emplace_back(v);
    graph[v].emplace_back(u);
  }
  vector<int> r(n), b(n);
  REP(i, n) cin >> r[i];
  REP(i, n) cin >> b[i];
  vector<int> color;
  ll ans = 0;
  if (is_bipartite(graph, &color)) {
    REP(_, 2) {
      ll score = 0;
      REP(i, n) score += (color[i] ? r : b)[i];
      chmax(ans, score);
      REP(i, n) color[i] ^= 1;
    }
  } else {
    ll maxi = 0;
    REP(i, n) maxi += max(r[i], b[i]);
    vector<ll> dist[2]{vector<ll>(n, LINF), vector<ll>(n, LINF)};
    priority_queue<pair<ll, pair<int, int>>, vector<pair<ll, pair<int, int>>>, greater<pair<ll, pair<int, int>>>> que;
    REP(root, n) REP(parity, 2) {
      REP(i, 2) fill(ALL(dist[i]), LINF);
      dist[parity][root] = max(parity ? r[root] - b[root] : b[root] - r[root], 0);
      que.emplace(dist[parity][root], make_pair(parity, root));
      ll loop = LINF;
      while (!que.empty()) {
        const auto [c, ij] = que.top(); que.pop();
        const auto [i, j] = ij;
        if (c > dist[i][j]) continue;
        for (int e : graph[j]) {
          if (e == root) {
            if (i == parity) chmin(loop, dist[i][j]);
          } else if (chmin(dist[i ^ 1][e], dist[i][j] + max(i ^ 1 ? r[e] - b[e] : b[e] - r[e], 0))) {
            que.emplace(dist[i ^ 1][e], make_pair(i ^ 1, e));
          }
        }
      }
      chmax(ans, maxi - loop);
    }
  }
  cout << ans << '\n';
  return 0;
}