#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e6 + 5;
const ll inf = 0x3f3f3f3f3f3f3f3f;
ll n, m, p, q, f[N], h[N], g[N];
namespace Flow{
    ll s, t;
    ll ecnt = 1, head[N], cur[N];
    struct edge{
        ll v, w, nxt;
    }e[N << 1];
    void add(ll u, ll v, ll w){
        e[++ecnt] = edge{v, w, head[u]}, head[u] = ecnt;
        e[++ecnt] = edge{u, 0, head[v]}, head[v] = ecnt;
    }
    ll num[N];
    bool bfs(ll s, ll t){
        fill(num + s, num + t + 1, 0);
        queue<int> q;
        q.push(s), cur[s] = head[s], num[s] = 1;
        while(q.size()){
            int u = q.front(); q.pop();
            _rev(i, u){
                int v = e[i].v;
                if(!num[v] && e[i].w){
                    num[v] = num[u] + 1;
                    cur[v] = head[v];
                    q.push(v);
                }
            }
        }
        return num[t];
    }
    ll dfs(ll u, ll in){
        ll out = 0;
        if(u == t) return in;
        for(int i = cur[u]; i && in; i = e[i].nxt){
            int v = e[i].v;
            cur[u] = i;
            if(e[i].w && num[v] == num[u] + 1){
                int d = dfs(v, min(e[i].w, in));
                e[i].w -= d, e[i ^ 1].w += d;
                in -= d, out += d;
            }
        }
        if(!out) num[u] = 0;
        return out;
    }
    ll Dinic(){
        ll Flow = 0;
        while(bfs(s, t)) Flow += dfs(s, inf);
        return Flow;
    }
}
using namespace Flow;
int main(){
    read(n, m, p, q);
    ll ans = 0;
    _rep(i, 1, n) read(f[i]);
    _rep(i, 1, n) read(h[i]);
    _rep(i, 1, m) read(g[i]), ans += g[i];
    s = 0, t = 2 * n + m + 1;
    _rep(i, 1, m) add(s, 2 * n + i, g[i]);
    _rep(i, 1, p){
        int u, v; read(u, v);
        add(2 * n + v, u, inf);
    }
    _rep(i, 1, q){
        int u, v; read(u, v);
        add(v + n, u, inf);
    }
    _rep(i, 1, n){
        if(f[i] > h[i]) add(i, t, h[i]), add(i, i + n, f[i] - h[i]);
        else add(i, t, f[i]);
    }
    writeln(ans - Dinic());
    return 0;
}