#include using namespace std; int main(){ int N, D, W; cin >> N >> D >> W; vector> E1(N); for (int i = 0; i < D; i++){ int a, b; cin >> a >> b; a--; b--; E1[a].push_back(b); E1[b].push_back(a); } vector> E2(N); for (int i = 0; i < W; i++){ int c, d; cin >> c >> d; c--; d--; E2[c].push_back(d); E2[d].push_back(c); } vector c1(N, -1); int cnt1 = 0; for (int i = 0; i < N; i++){ if (c1[i] == -1){ c1[i] = cnt1; queue Q; Q.push(i); while (!Q.empty()){ int v = Q.front(); Q.pop(); for (int w : E1[v]){ if (c1[w] == -1){ c1[w] = cnt1; Q.push(w); } } } cnt1++; } } vector c2(N, -1); int cnt2 = 0; vector sz; for (int i = 0; i < N; i++){ if (c2[i] == -1){ c2[i] = cnt2; int cnt = 1; queue Q; Q.push(i); while (!Q.empty()){ int v = Q.front(); Q.pop(); for (int w : E2[v]){ if (c2[w] == -1){ c2[w] = cnt2; cnt++; Q.push(w); } } } sz.push_back(cnt); cnt2++; } } vector> st(cnt1); for (int i = 0; i < N; i++){ st[c1[i]].insert(c2[i]); } vector ans(cnt1, 0); for (int i = 0; i < cnt1; i++){ for (int j : st[i]){ ans[i] += sz[j]; } } long long sum = 0; for (int i = 0; i < N; i++){ sum += ans[c1[i]]; } sum -= N; cout << sum << endl; }