#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i <= n; i++)
#define rep3(i, x, n) for (int i = x; i >= n; i--)
#define each(e, v) for (auto &e : v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;

template <typename T>
bool chmax(T &x, const T &y) {
    return (x < y) ? (x = y, true) : false;
}

template <typename T>
bool chmin(T &x, const T &y) {
    return (x > y) ? (x = y, true) : false;
}

template <typename T>
int flg(T x, int i) {
    return (x >> i) & 1;
}

template <typename T>
void print(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');
    if (v.empty()) cout << '\n';
}

template <typename T>
void printn(const vector<T> &v, T x = 0) {
    int n = v.size();
    for (int i = 0; i < n; i++) cout << v[i] + x << '\n';
}

template <typename T>
int lb(const vector<T> &v, T x) {
    return lower_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
int ub(const vector<T> &v, T x) {
    return upper_bound(begin(v), end(v), x) - begin(v);
}

template <typename T>
void rearrange(vector<T> &v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <typename T>
vector<int> id_sort(const vector<T> &v, bool greater = false) {
    int n = v.size();
    vector<int> ret(n);
    iota(begin(ret), end(ret), 0);
    sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });
    return ret;
}

template <typename S, typename T>
pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first + q.first, p.second + q.second);
}

template <typename S, typename T>
pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {
    return make_pair(p.first - q.first, p.second - q.second);
}

template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &p) {
    S a;
    T b;
    is >> a >> b;
    p = make_pair(a, b);
    return is;
}

template <typename S, typename T>
ostream &operator<<(ostream &os, const pair<S, T> &p) {
    return os << p.first << ' ' << p.second;
}

struct io_setup {
    io_setup() {
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        cout << fixed << setprecision(15);
    }
} io_setup;

const int inf = (1 << 30) - 1;
const ll INF = (1LL << 60) - 1;
const int MOD = 1000000007;
// const int MOD = 998244353;

struct Union_Find_Tree {
    vector<int> data;
    const int n;
    int cnt;

    Union_Find_Tree(int n) : data(n, -1), n(n), cnt(n) {}

    int root(int x) {
        if (data[x] < 0) return x;
        return data[x] = root(data[x]);
    }

    int operator[](int i) { return root(i); }

    bool unite(int x, int y) {
        x = root(x), y = root(y);
        if (x == y) return false;
        if (data[x] > data[y]) swap(x, y);
        data[x] += data[y], data[y] = x;
        cnt--;
        return true;
    }

    int size(int x) { return -data[root(x)]; }

    int count() { return cnt; };

    bool same(int x, int y) { return root(x) == root(y); }

    void clear() {
        cnt = n;
        fill(begin(data), end(data), -1);
    }
};

int main() {
    int N, M;
    cin >> N >> M;

    Union_Find_Tree uf(2 * N);
    vector<vector<int>> es(N);

    rep(i, M) {
        int u, v;
        cin >> u >> v;
        u--, v--;
        uf.unite(u, N + v), uf.unite(N + u, v);
        es[u].eb(v), es[v].eb(u);
    }

    vector<ll> A(N), B(N);
    rep(i, N) cin >> A[i];
    rep(i, N) cin >> B[i];

    if (!uf.same(0, N)) {
        ll ans1 = 0, ans2 = 0;
        rep(i, N) {
            ans1 += (uf.same(0, i) ? A[i] : B[i]);
            ans2 += (uf.same(0, i) ? B[i] : A[i]);
        }
        cout << max(ans1, ans2) << '\n';
        return 0;
    }

    ll S = 0;
    rep(i, N) {
        if (A[i] < B[i]) {
            S += B[i];
            A[i] = B[i] - A[i];
            B[i] = 0;
        } else {
            S += A[i];
            B[i] = A[i] - B[i];
            A[i] = 0;
        }
    }

    ll ans = -INF;
    // print(A), print(B);

    rep(i, N) {
        {
            vector<ll> d(2 * N, INF);
            priority_queue<pli, vector<pli>, greater<pli>> que;
            que.emplace(d[i] = 0, i);
            while (!empty(que)) {
                auto [t, p] = que.top();
                que.pop();
                if (d[p] < t) continue;
                int u = p % N, c = p / N;
                each(e, es[u]) {
                    ll tmp = t + (c == 0 ? B[e] : A[e]);
                    int np = N * (c ^ 1) + e;
                    if (np == N + i) chmax(ans, S - tmp);
                    if (chmin(d[np], tmp)) que.emplace(d[np], np);
                }
            }
        }
        {
            vector<ll> d(2 * N, INF);
            priority_queue<pli, vector<pli>, greater<pli>> que;
            que.emplace(d[N + i] = 0, N + i);
            while (!empty(que)) {
                auto [t, p] = que.top();
                que.pop();
                if (d[p] < t) continue;
                int u = p % N, c = p / N;
                each(e, es[u]) {
                    ll tmp = t + (c == 0 ? B[e] : A[e]);
                    int np = N * (c ^ 1) + e;
                    if (np == i) chmax(ans, S - tmp);
                    if (chmin(d[np], tmp)) que.emplace(d[np], np);
                }
            }
        }
    }

    cout << ans << '\n';
}