#line 1 "a.cpp"
#include<iostream>
#include<vector>
using namespace std;
#line 2 "/home/kotatsugame/library/datastructure/UF.cpp"
struct UF{
	int n;
	vector<int>parent,rank;
	UF(int n_=0):n(n_),parent(n_),rank(n_,1)
	{
		for(int i=0;i<n_;i++)parent[i]=i;
	}
	int find(int a){return parent[a]!=a?parent[a]=find(parent[a]):a;}
	bool same(int a,int b){return find(a)==find(b);}
	bool unite(int a,int b)
	{
		a=find(a),b=find(b);
		if(a==b)return false;
		if(rank[a]<rank[b])
		{
			parent[a]=b;
			rank[b]+=rank[a];
		}
		else
		{
			parent[b]=a;
			rank[a]+=rank[b];
		}
		return true;
	}
	int size(int a){return rank[find(a)];}
};
#line 5 "a.cpp"
int N,A,B;
int vis[1<<17];
main()
{
	cin>>N>>A>>B;
	UF ua(N),ub(N);
	for(int i=0;i<A;i++)
	{
		int a,b;cin>>a>>b;
		a--,b--;
		ua.unite(a,b);
	}
	for(int i=0;i<B;i++)
	{
		int a,b;cin>>a>>b;
		a--,b--;
		ub.unite(a,b);
	}
	vector<vector<int> >AU(N);
	for(int i=0;i<N;i++)AU[ua.find(i)].push_back(i);
	long ans=0;
	int tm=0;
	for(const vector<int>&a:AU)if(!a.empty())
	{
		long now=0;
		tm++;
		for(int u:a)
		{
			int id=ub.find(u);
			if(vis[id]<tm)
			{
				vis[id]=tm;
				now+=ub.size(u);
			}
		}
		ans+=now*a.size();
	}
	cout<<ans-N<<endl;
}