#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define endl '\n'
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

inline int topbit(unsigned long long x){
	return x?63-__builtin_clzll(x):-1;
}

inline int popcount(unsigned long long x){
	return __builtin_popcountll(x);
}

inline int parity(unsigned long long x){//popcount%2
	return __builtin_parity(x);
}



template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll INF=1e9+7;

vector<vector<pll>> to;

vector<vector<ll>> visited;
vector<vector<ll>> ans;

ll dfs(ll v,bool ok,ll p=-1){
    ll res=1;
    if(ok) visited[0][v]=1;
    else visited[1][v]=1;
    for(auto [x,y]:to[v]){
        if(x==p) continue;
        if(visited[0][x] || visited[1][x]) continue;
        if(y==0){
            if(ans[1][v]!=0){
                res+=ans[1][v];
            }
            else{
                res+=dfs(x,false,v);
            }
        }
        if(y==1 && ok){
            if(ans[0][v]!=0){
                res+=ans[0][v];
            }
            else{
                res+=dfs(x,true,v);
            }
        }
    }
    if(ok) return ans[0][v]=res;
    else return ans[1][v]=res;
}

class DisjointSet{
    public:
    vector<ll> rank,p,sz;
    DisjointSet(){}
    DisjointSet(ll size){ //作られうる木の頂点数の最大値を入れる。
        rank.resize(size,0);
        p.resize(size,0);
        sz.resize(size,1);
        rep(i,size) makeSet(i);
    }
    void makeSet(ll x){ //xだけが属する木を作る。
        p[x]=x;
        rank[x]=0;
    }
    bool same(ll x,ll y){ //xとyが同じ木に属するかどうか
        return findSet(x)==findSet(y);
    }
    void unite(ll x, ll y){
        link(findSet(x),findSet(y));
    }
    void link(ll x, ll y){ //rankが大きい方の根に小さい方の根をつける。
        if(rank[x]>rank[y]){
            p[y]=x;
        }
        else{
            p[x]=y;
            if(rank[x]==rank[y]){
                rank[y]++; //xとyの木のrankが同じであれば、統合するとrankが1増える。
            }
        }
        sz[x]+=sz[y];
        sz[y]=sz[x];
    }
    ll findSet(ll x){ //xが属する木の根の番号を返す
        if(x!=p[x]){
            p[x]=findSet(p[x]);
        }
        return p[x];
    }
};

int main(){
    ll n,D,w;
    cin >> n >>D >> w;
    vector<ll> a(D),b(D);
    vector<ll> c(w),d(w);
    to=vector<vector<pll>>(n);
    ans=vector<vector<ll>>(2,vector<ll>(n));
    visited=vector<vector<ll>>(2,vector<ll>(n));
    DisjointSet ds1=DisjointSet(n+1);
    DisjointSet ds2=DisjointSet(n+1);
    rep(i,D){
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
        to[a[i]].push_back({b[i],1});
        to[b[i]].push_back({a[i],1});
        if(!ds1.same(a[i],b[i])){
            ds1.unite(a[i],b[i]);
        }
    }
    rep(i,w){
        cin >> c[i] >> d[i];
        c[i]--;
        d[i]--;
        to[c[i]].push_back({d[i],0});
        to[d[i]].push_back({c[i],0});
        if(!ds2.same(c[i],d[i])){
            ds2.unite(c[i],d[i]);
        }
    }
    ll sum=0;
    rep(i,n){
        if(ans[0][i]==0) ll s=dfs(i,true);
        if(ans[1][i]==0) ll t=dfs(i,false);
        sum+=ans[0][i]+ans[1][i];
    }
    rep(i,n){
        //cout << ans[0][i] << " " << ans[1][i] << endl;
    }
    
    cout << sum << endl;
    return 0;
}