#include <bits/stdc++.h>
 
#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)
 
#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=(int)(a)-1;i>=(int)(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)
 
#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
 
// #define DEBUG
 
#ifdef DEBUG
    #define dump(...) fprintf(stderr, __VA_ARGS__)
#else
    #define dump(...)
#endif
 
template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}
 
using namespace std;
using ll=long long;
using vi=vector<int>;
using vll=vector<ll>;
 
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int inf =1 << 25;
const ll mod=1000000007LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
 
 
ll extgcd(ll a,ll b,ll& x,ll& y){x=1,y=0;ll g=a;if(b!=0) g=extgcd(b,a%b,y,x),y-=a/b*x;return g;}
ll ADD(const ll &a, const ll &b,const ll &mod) { return (a+b)%mod;}
ll SUB(const ll &a, const ll &b,const ll &mod) { return (a-b+mod)%mod;}
ll MUL(const ll &a, const ll &b,const ll &mod) { return (1LL*a*b)%mod;}
ll DIV(const ll &a, const ll &b,const ll &mod) {ll x,y; extgcd(b,mod,x,y);return MUL(a,(x+mod)%mod,mod);}
 
random_device rd;
mt19937 mt(rd());
uniform_int_distribution<int> dice(1,6);
uniform_real_distribution<double> score(0.0,10.0);

int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n; cin >> n; vi i2v(n), num(3);
    for(auto& e : num) cin >> e;
    rep(i, n) i2v[i] = i;
    vi sts;
    for(auto& m : num){
        vi a(m); for(auto& e : a) cin >> e, e--;
        sort(_all(a));
        for(auto& e : a) i2v[e] = a[0];
        sts.emplace_back(a[0]);
    }

    vector<vi> G(n);
    int m; cin >> m;
    rep(loop, m){
        int a, b; cin >> a >> b;
        a--, b--;
        a = i2v[a], b = i2v[b];
        G[a].emplace_back(b);
        G[b].emplace_back(a);
    }

    using Elem = tuple<int, int>;
    vector<vector<Elem>> min_dist(3, vector<Elem>(n, Elem(inf, inf)));
    rep(_, 3){
        int s = sts[_];
        auto& min_d = min_dist[_];
        min_d[s] = Elem(0, s);
        queue<int> q; q.push(s);

        vi used(n);
        while(q.size()){
            int v = q.front(); q.pop();
            if(used[v]) continue;
            used[v] = true;
            int c, mi; tie(c, mi) = min_d[v];

            for(auto& nv : G[v]){
                int nc = c + 1;
                if(chmin(min_d[nv], Elem(nc, min(mi, nv)))){
                    q.push(nv);
                }
            }
        }
    }

    int res = n, resi = 0;
    rep(i, n){
        int cur = 0, curi = n;
        rep(j, 3) cur += get<0>(min_dist[j][i]), chmin(curi, get<1>(min_dist[j][i]));
        if(cur < res or (res == cur and curi < resi)){
            res = cur;
            resi = curi;
        }
    }

    cout << res << " " << resi + 1 << endl;

    return 0;
}

Measured memory_bytes: 9144