#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int N,D,W;

template<int um> class UF {
	public:
	vector<int> par,rank,cnt;
	UF() {par=rank=vector<int>(um,0); cnt=vector<int>(um,1); for(int i=0;i<um;i++) par[i]=i;}
	void reinit() {int i; FOR(i,um) rank[i]=0,cnt[i]=1,par[i]=i;}
	int operator[](int x) {return (par[x]==x)?(x):(par[x] = operator[](par[x]));}
	int count(int x) { return cnt[operator[](x)];}
	int operator()(int x,int y) {
		if((x=operator[](x))==(y=operator[](y))) return x;
		cnt[y]=cnt[x]=cnt[x]+cnt[y];
		if(rank[x]>rank[y]) return par[x]=y;
		rank[x]+=rank[x]==rank[y]; return par[y]=x;
	}
};
UF<202020> uf,uf2;
set<int> C[202020];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>D>>W;
	FOR(i,D) {
		cin>>x>>y;
		uf(x-1,y-1);
	}
	FOR(i,N) C[i].insert(uf[i]);
	FOR(i,W) {
		cin>>x>>y;
		x=uf2[x-1];
		y=uf2[y-1];
		if(x!=y) {
			uf2(x,y);
			r=uf2[x];
			k=x+y-r;
			if(C[r].size()<C[k].size()) swap(C[r],C[k]);
			FORR(e,C[k]) C[r].insert(e);
			C[k].clear();
		}
	}
	ll ret=0;
	FOR(i,N) if(uf2[i]==i) {
		ll a=uf2.count(i);
		ll b=0;
		FORR(e,C[i]) b+=uf.count(e);
		ret+=a*b;
	}
	ret-=N;
	cout<<ret<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}