#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
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; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;

int N, D, W;
vector<VI>G;
bool vis[200010];
struct UnionFind {
	VI par, s;
	UnionFind(int N) :par(N), s(N) {
		REP(i, N)par[i] = i;
		REP(i, N)s[i] = 1;
	}
	int root(int x) {
		if (par[x] == x)return x;
		return par[x] = root(par[x]);
	}
	void unite(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		if (rx == ry)return;
		if (!(same(x, y)))s[ry] += s[rx];
		par[rx] = ry;
	}
	bool same(int x, int y) {
		int rx = root(x);
		int ry = root(y);
		return rx == ry;
	}
	int size(int x) {
		return s[root(x)];
	}
};
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> N >> D >> W;
	G.resize(N);
	UnionFind X(N), Y(N);
	REP(i, D) {
		int a, b; cin >> a >> b;
		a--, b--;
		X.unite(a, b);
		G[a].push_back(b);
		G[b].push_back(a);
	}
	REP(i, W) {
		int a, b; cin >> a >> b;
		a--, b--;
		Y.unite(a, b);
	}
	int ans = 0;
	REP(i, N) {
		if (vis[i])continue;
		VI tmp;
		queue<int>Q;
		bool F[200010] = { false };
		Q.push(i);
		vis[i] = 1;
		while (!Q.empty()) {
			int now = Q.front();
			Q.pop();
			
			tmp.push_back(now);
			fore(to, G[now]) {
				if (!vis[to]) {
					Q.push(to);
					vis[to] = 1;
				}
			}
		}
		int cnt = 0;
		fore(j, tmp) {
			//cout << j << " ";
			if (!F[Y.root(j)]) {
				F[Y.root(j)] = 1;
				cnt += Y.size(j);
			}
		}
		//cout << cnt << endl;
		ans += (int)tmp.size()*cnt;
		ans -= (int)tmp.size();

	}

	cout << ans << endl;
	return 0;
}