#include <bits/stdc++.h>
#pragma GCC optimize(2)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<cmath>
#include<cstring>
#include<bitset>
#include<stack>
#include<time.h>



#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define scd(a) scanf("%d",&a)
#define scdd(a,b) scanf("%d%d",&a,&b)
#define scddd(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define ALL(x) x.begin(),x.end()
#define sz(a) ((int)a.size())
#define getmid ((l+r)>>1)
#define mst(var,val) memset(var,val,sizeof(var))
#define IOS ios::sync_with_stdio(false);cin.tie(0)
#define lowbit(x) x&(-x)
#define rep(i,n) for(int i=0;i<n;++i)
#define rep1(i,n) for(int i=1;i<=n;++i)
#define ls rt<<1
#define rs rt<<1|1
using namespace std;
#ifdef local
#define dbg(args...) cout << #args << " -> ", err(args);
void err(){ cout << endl; }
template<typename T, typename... Args>
void err(T a, Args... args){ cout << a << ' '; err(args...); }
#else
#define dbg(args...)
#endif // local

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <int, ll> pil;
typedef pair <double, double> pdd;
const int inf=0x3f3f3f3f;
const long long INF=0x3f3f3f3f3f3f3f3fLL;
const double PI=acos(-1.0);
const long double eps=1e-8;
const int mod=1e9+7;
const int maxn=2e5+100;
const int N=1e6+100;
const int M=(1<<20)+10;

template <class T>
inline void read(T &x)
{
    x = 0;
    char c = getchar();
    bool f = 0;
    for (; !isdigit(c); c = getchar())
        f ^= c == '-';
    for (; isdigit(c); c = getchar())
        x = x * 10 + (c ^ 48);
    x = f ? -x : x;
}

template <class T>
inline void write(T x)
{
    if (x < 0)
    {
        putchar('-');
        x = -x;
    }
    T y = 1;
    int len = 1;
    for (; y <= x / 10; y *= 10)
        ++len;
    for (; len; --len, x %= y, y /= 10)
        putchar(x / y + 48);
}
ll qpow(ll a,ll b,ll mod)
{
    ll ans=1;
    while(b)
    {
        if(b&1)
            ans=(ans*a)%mod;
        b>>=1;
        a=(a*a)%mod;
    }
    return ans;
}


int n[5],m[5];
int a[5][N];
multiset<int>mt[2];
vector<int>g[6][N];
int main()
{
#ifdef local
    freopen("in.txt","r",stdin);
#endif // local
    //IOS;cout.tie(0);
    rep1(i,4) read(n[i]);
    rep1(i,4) rep1(j,n[i]) read(a[i][j]);
    for(int i=2;i<=4;++i)
    {
        read(m[i]);
        for(int j=1;j<=m[i];++j)
        {
            int x,y;read(x);read(y);
            g[i][y].PB(x);
        }
    }
    for(int i=1;i<=n[1];++i) mt[0].insert(a[1][i]);
    int tag=1;
    for(int now=2;now<=4;++now)
    {
        mt[tag].clear();
        for(int i=1;i<=n[now];++i)
        {
            for(auto to:g[now][i])
            {
                mt[tag^1].erase(mt[tag^1].find(a[now-1][to]));
            }
            if(!mt[tag^1].empty()) a[now][i]+=*mt[tag^1].begin();
            else a[now][i]=inf;
            if(a[now][i]>inf) a[now][i]=inf;
            mt[tag].insert(a[now][i]);
            for(auto to:g[now][i])
            {
                mt[tag^1].insert(a[now-1][to]);
            }

        }
        tag^=1;
    }
    ll ans=*mt[tag^1].begin();
    if(ans!=inf) write(ans);
    else write(-1);
    return 0;
}

