#include<bits/stdc++.h>
#define LL long long
#define LLL __int128
#define uint unsigned
#define ldb long double
#define uLL unsigned long
using namespace std;
template<class T,int N>struct Dinic{
    const T INF=numeric_limits<T>::max()/2;
    int n,s,t,h[N],d[N];
    vector<tuple<int,T,int>>G[N];
    inline void add(const int&u,const int&v,const T&w,const T&rw=0){
        if(u!=v){
            const int ru=G[v].size(),rv=G[u].size();
            G[u].emplace_back(v,w,ru),G[v].emplace_back(u,rw,rv);
        }
    }
    inline bool bfs(){
        int ql=0,qr=1;static int Q[N];
        for(fill(d+1,d+n+1,-1),d[Q[1]=s]=0;ql<qr;){
            int u=Q[++ql];h[u]=0;if(u==t)return 1;
            for(auto [v,w,_]:G[u])if(w&&d[v]<0)d[Q[++qr]=v]=d[u]+1;
        }
        return 0;
    }
    inline T dfs(const int&u,T mf){
        if(u==t)return mf;
        T z=0;
        for(int&i=h[u];i<G[u].size();++i){
            const auto [v,w,j]=G[u][i];
            if(d[u]+1==d[v]&&w){
                const T dd=dfs(v,min(mf,w));
                get<1>(G[u][i])-=dd,mf-=dd,get<1>(G[v][j])+=dd,z+=dd;
                if(!mf)return z;
            }
        }
        return d[u]=-1,z;
    }
    inline void init(const int&_n,const int&_s,const int&_t){
        n=_n,s=_s,t=_t;for(int i=1;i<=n;++i)G[i].clear();
    }
    inline T flow(){T z=0;while(bfs())z+=dfs(s,INF);return z;}
};
const int N=105,M=105;const LL INF=1e13;
int n,m,p,q;LL ans;
int a[N],b[N],c[N];
Dinic<LL,N*2+M>Gr;
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>m>>p>>q,Gr.init(n*2+m+2,n*2+m+1,n*2+m+2);
    for(int i=1;i<=n;++i)cin>>a[i];
    for(int i=1;i<=n;++i)cin>>b[i],b[i]=min(a[i],b[i]),Gr.add(Gr.s,i,b[i]),Gr.add(i+n,i,a[i]-b[i]);
    for(int i=1;i<=m;++i)cin>>c[i],Gr.add(n+n+i,Gr.t,c[i]),ans+=c[i];
    for(int i=1;i<=p;++i){int u,v;cin>>u>>v;Gr.add(u,n+n+v,INF);}
    for(int i=1;i<=q;++i){int u,v;cin>>u>>v;Gr.add(u,v+n,INF);}
    cout<<ans-Gr.flow()<<'\n';
    return 0;
}
/*
*/