#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


struct union_find{
    vector<int> par;
    vector<int> siz;
    
    union_find(int n) : par(n), siz(n, 1){
        for(int i=0; i<n; i++) par[i] = i;
    }
    
    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 (siz[rx] < siz[ry]) swap(rx, ry);
        siz[rx] += siz[ry];
        par[ry] = rx;
    }
 
    bool same(int x, int y){
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
 
    int size(int x){
        return siz[root(x)];
    }
};


void solve(){
    int n, d, w; cin >> n >> d >> w;
    union_find uf0(n), uf1(n);
    for(int i=0; i<d; i++){
        int a, b; cin >> a >> b;
        uf0.unite(a-1, b-1);
    }
    for(int i=0; i<w; i++){
        int a, b; cin >> a >> b;
        uf1.unite(a-1, b-1);
    }

    vector<map<int, int>> mp(n);
    for(int v=0; v<n; v++){
        if(mp[uf0.root(v)].find(uf1.root(v)) == mp[uf0.root(v)].end()){
            mp[uf0.root(v)][uf1.root(v)] = uf1.size(v)-1;
        }else{
            mp[uf0.root(v)][uf1.root(v)]--;
        }
    }

    ll ans = 0LL;
    for(int v=0; v<n; v++) if(uf0.root(v)==v){
        ans += (ll)uf0.size(v) * ((ll)uf0.size(v)-1);
        for(auto [r1, cnt] : mp[v]){
            ans += (ll)uf0.size(v) * (ll)cnt;
        }
    }

    cout << ans << '\n';
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}