#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

struct UnionFind{
    int con;
    vector<int> par,siz;
    UnionFind(int n):con(n),par(n),siz(n,1){
        iota(begin(par),end(par),0);
    }
    int root(int x){
        return (par[x]==x?x:(par[x]=root(par[x])));
    }
    bool sameroot(int x,int y){
        return root(x)==root(y);
    }
    bool unite(int x,int y){
        x=root(x);y=root(y);
        if(x==y) return false;
        if(siz[x]<siz[y])swap(x,y);
        siz[x]+=siz[y];
        par[y]=x;
        con--;
        return true;
    }
    int size(int x){
        return siz[root(x)];
    }
};

signed main(){
    int n,d,w;cin>>n>>d>>w;
    UnionFind ufd(n),ufw(n);
    vector<vector<int>> gd(n),gw(n);
    rep(i,d){
        int u,v;cin>>u>>v;u--,v--;
        gd[u].push_back(v);
        gd[v].push_back(u);
        ufd.unite(u,v);
    }

    rep(i,w){
        int u,v;cin>>u>>v;u--,v--;
        gw[u].push_back(v);
        gw[v].push_back(u);
    }

    ll res=0;

    rep(i,n)if(ufd.root(i)==i){
        ll k=ufd.size(i);
        res+=k*k;
    }

    vector<bool> check(n,false);
    rep(i,n)if(not check[i]){
        map<int,ll> cnt;
        function<void(int)> dfs=[&](int cur){
            cnt[ufd.root(cur)]++;
            for(auto to:gw[cur])if(not check[to]){
                check[to]=true;
                dfs(to);
            }
        };
        check[i]=true;
        dfs(i);

        ll sum=0;
        for(auto [_,v]:cnt) sum+=v;
        for(auto [par,v]:cnt){
            res+=(ll)(sum-v)*ufd.size(par);
        }
    }
    res-=n;
    cout<<res<<endl;
    return 0;
}