#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace __gnu_pbds;
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair<int, int>
#define ull unsigned long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rngl(chrono::steady_clock::now().time_since_epoch().count());
// #define int long long
// #define int unsigned long long
// #define ordered_set(T) tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>
// #define ordered_multiset(T) tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
const ll inf = 1e9;
const ll biginf = 1e18;
const int maxN = 2005;
vector<int> g[maxN];
int n, m, dist[maxN][maxN], cnt[maxN][maxN];
void init(int v) {
for (int i = 1; i <= n; i++) dist[v][i] = inf;
queue<int> q;
dist[v][v] = 0; cnt[v][v] = 1; q.push(v);
while (!q.empty()) {
int u = q.front(); q.pop();
for (int x : g[u]) {
if (dist[v][x] > dist[v][u] + 1) {
dist[v][x] = dist[v][u] + 1; cnt[v][x] = cnt[v][u]; q.push(x);
} else if (dist[v][x] == dist[v][u] + 1) cnt[v][x] += cnt[v][u];
}
}
}
void solve() {
cin >> n >> m;
for (int i = 1; i <= m; i++) {
int x, y; cin >> x >> y; x++; y++;
g[x].pb(y); g[y].pb(x);
}
for (int i = 1; i <= n; i++) init(i);
int k; cin >> k; double ans[n + 1]{};
while (k--) {
int x, y; cin >> x >> y; x++; y++;
for (int i = 1; i <= n; i++) {
if (dist[x][i] + dist[i][y] == dist[x][y]) {
ans[i] += 1.0 * cnt[x][i] * cnt[i][y] / cnt[x][y];
}
}
}
int mx = 1;
for (int i = 2; i <= n; i++)
if (ans[i] > ans[mx]) mx = i;
cout << mx - 1;
}
int32_t main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
int t = 1;
// cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
