#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

int id[1 << 17];
vector<int> G[1 << 17];

int dist[1 << 17][3];
int n;
void yaru(int s, int id) {
	rep(i, n + 3)dist[i][id] = mod;
	queue<int> q;
	q.push(s); dist[s][id] = 0;
	while (!q.empty()) {
		int v = q.front(); q.pop();
		for (int to : G[v]) {
			if (dist[v][id] + 1 < dist[to][id]) {
				dist[to][id] = dist[v][id] + 1;
				q.push(to);
			}
		}
	}
}

bool ok[1 << 17][3];
void solve() {
	cin >> n;
	fill(id, id + n, -1);
	int l[3]; rep(i, 3)cin >> l[i];
	rep(i, 3) {
		rep(j, l[i]) {
			int a; cin >> a; a--;
			id[a] = i;
		}
	}
	int m; cin >> m;
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		if (id[a] >= 0)a = n + id[a];
		if (id[b] >= 0)b = n + id[b];
		G[a].push_back(b);
		G[b].push_back(a);
	}
	rep(i, 3)yaru(n + i, i);
	int mi = mod;
	mi = min(mi, dist[n+1][0] + dist[n+2][0]);
	mi = min(mi, dist[n][1] + dist[n + 2][1]);
	mi = min(mi, dist[n][2] + dist[n + 1][2]);
	rep(i, n) {
		if (id[i] < 0) {
			int sum = 0;
			rep(j, 3)sum += dist[i][j];
			mi = min(mi, sum);
		}
	}
	int chk = mod;
	per(i, n)if (id[i] >= 0)chk = i;
	queue<int> q[3];
	if (mi == dist[n + 1][0] + dist[n + 2][0])rep(j, 3)q[j].push(n);
	if (mi == dist[n][1] + dist[n + 2][1])rep(j,3)q[j].push(n + 1);
	if (mi == dist[n][2] + dist[n + 1][2])rep(j,3)q[j].push(n + 2);
	rep(i, n)if (id[i] < 0) {
		int sum = 0;
		rep(j, 3)sum += dist[i][j];
		if (sum == mi) {
			rep(j, 3) {
				ok[i][j] = true;
				q[j].push(i);
			}
		}
	}
	rep(i, 3) {
		while (!q[i].empty()) {
			int id = q[i].front(); q[i].pop();
			for (int to : G[id]) {
				if (ok[to][i])continue;
				if (dist[id][i] - 1 == dist[to][i]) {
					ok[to][i] = true; q[i].push(to);
				}
			}
		}
	}
	rep(i, n)if (id[i] < 0) {
		bool exi = false; rep(j, 3)if (ok[i][j])exi = true;
		if (exi)chk = min(chk, i);
	}
	cout << mi << " " << chk + 1 << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	init_f();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}


### Prompt

Generate a Cpp solution to the following problem:

Example

Input

4 2 1 1
1 2
3
4
3
1 2
2 4
3 4


Output

2 1

### Response

```cpp
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%mod;
		a = a * a%mod; n >>= 1;
	}
	return res;
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

int id[1 << 17];
vector<int> G[1 << 17];

int dist[1 << 17][3];
int n;
void yaru(int s, int id) {
	rep(i, n + 3)dist[i][id] = mod;
	queue<int> q;
	q.push(s); dist[s][id] = 0;
	while (!q.empty()) {
		int v = q.front(); q.pop();
		for (int to : G[v]) {
			if (dist[v][id] + 1 < dist[to][id]) {
				dist[to][id] = dist[v][id] + 1;
				q.push(to);
			}
		}
	}
}

bool ok[1 << 17][3];
void solve() {
	cin >> n;
	fill(id, id + n, -1);
	int l[3]; rep(i, 3)cin >> l[i];
	rep(i, 3) {
		rep(j, l[i]) {
			int a; cin >> a; a--;
			id[a] = i;
		}
	}
	int m; cin >> m;
	rep(i, m) {
		int a, b; cin >> a >> b; a--; b--;
		if (id[a] >= 0)a = n + id[a];
		if (id[b] >= 0)b = n + id[b];
		G[a].push_back(b);
		G[b].push_back(a);
	}
	rep(i, 3)yaru(n + i, i);
	int mi = mod;
	mi = min(mi, dist[n+1][0] + dist[n+2][0]);
	mi = min(mi, dist[n][1] + dist[n + 2][1]);
	mi = min(mi, dist[n][2] + dist[n + 1][2]);
	rep(i, n) {
		if (id[i] < 0) {
			int sum = 0;
			rep(j, 3)sum += dist[i][j];
			mi = min(mi, sum);
		}
	}
	int chk = mod;
	per(i, n)if (id[i] >= 0)chk = i;
	queue<int> q[3];
	if (mi == dist[n + 1][0] + dist[n + 2][0])rep(j, 3)q[j].push(n);
	if (mi == dist[n][1] + dist[n + 2][1])rep(j,3)q[j].push(n + 1);
	if (mi == dist[n][2] + dist[n + 1][2])rep(j,3)q[j].push(n + 2);
	rep(i, n)if (id[i] < 0) {
		int sum = 0;
		rep(j, 3)sum += dist[i][j];
		if (sum == mi) {
			rep(j, 3) {
				ok[i][j] = true;
				q[j].push(i);
			}
		}
	}
	rep(i, 3) {
		while (!q[i].empty()) {
			int id = q[i].front(); q[i].pop();
			for (int to : G[id]) {
				if (ok[to][i])continue;
				if (dist[id][i] - 1 == dist[to][i]) {
					ok[to][i] = true; q[i].push(to);
				}
			}
		}
	}
	rep(i, n)if (id[i] < 0) {
		bool exi = false; rep(j, 3)if (ok[i][j])exi = true;
		if (exi)chk = min(chk, i);
	}
	cout << mi << " " << chk + 1 << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(12);
	init_f();
	//int t; cin >> t; rep(i, t)solve();
	solve();
	stop
		return 0;
}


```