#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
class UnionFindUndo {
public:
	vector<int> parent;
	vector<pair<int, int>> history;
	UnionFindUndo(int n) {
		parent.assign(n, -1);
	}
	int root(int x) {
		if (parent[x] < 0) {
			return x;
		}
		return root(parent[x]);
	}

	long long size(int x) {
		return -(long long)parent[root(x)];
	}

	bool connect(int x, int y) {
		x = root(x);
		y = root(y);
		history.emplace_back(x, parent[x]);
		history.emplace_back(y, parent[y]);
		if (x == y) {
			return false;
		}
		if (size(x) < size(y)) {
			swap(x, y);
		}

		parent[x] += parent[y];
		parent[y] = x;
		return true;
	}

	void undo() {
		parent[history.back().first] = history.back().second;
		history.pop_back();
		parent[history.back().first] = history.back().second;
		history.pop_back();
	}

	void snapshot() {
		history.clear();
	}

	void rollback() {
		while (!history.empty()) undo();
	}
};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,d,w;cin >> n >> d >> w;
    UnionFindUndo uf(n*2);
    REP(i,d){
        int a,b;cin >> a >> b;
        a--,b--;
        uf.connect(a,b);
    }
    REP(i,w){
        int a,b;cin >> a >> b;
        a--,b--;
        uf.connect(a+n,b+n);
    }
    vector<vector<int>> r(n);
    REP(i,n) r[uf.root(i)].push_back(i);
    ll ans=0;
    uf.snapshot();
    REP(i,n){
        if(r[i].size()==0) continue;
        for(auto x:r[i]){
            uf.connect(x,x+n);
        }
        ans+=1LL*r[i].size()*(uf.size(r[i][0])-r[i].size()-1);
        uf.rollback();
    }
    cout << ans << endl;
}