#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class T> using vec = vector<T>;
template <class T> using vvec = vector<vec<T>>;
template<class T> bool chmin(T& a,T b){if(a>b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a,T b){if(a<b) {a = b; return true;} return false;}
#define rep(i,n) for(int i=0;i<(n);i++)
#define drep(i,n) for(int i=(n)-1;i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define debug(x)  cerr << #x << " = " << (x) << endl;

class UnionFind{
private:
    vec<int> p;
    vec<ll> s;
    int cnt;
public:
    UnionFind(){}
    UnionFind(int N):cnt(N),s(N,1),p(N){
        iota(p.begin(),p.end(),0);
    }
    int find(int x){
        if(p[x]==x) return x;
        else return p[x] = find(p[x]);
    }
    void unite(int x,int y){
        x = find(x); y = find(y);
        if(x==y) return;
        if(s[x]>s[y]) swap(x,y);
        p[x] = y;
        s[y] += s[x];
        cnt--;
    }
    bool is_same_set(int x,int y) {return find(x)==find(y);}
    int size(int x) {return s[find(x)];}
    int compnents_number(){return cnt;}
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,D,W;
    cin >> N >> D >> W;
    UnionFind uf0(N),uf1(N);
    rep(i,D){
        int a,b;
        cin >> a >> b;
        a--,b--;
        uf0.unite(a,b);
    }
    rep(i,W){
        int a,b;
        cin >> a >> b;
        a--,b--;
        uf1.unite(a,b);
    }
    ll ans = 0;
    set<pair<int,int>> s;
    rep(i,N){
        int a = uf0.find(i),b = uf1.find(i);
        if(s.count({a,b})) continue;
        ans += uf0.size(i)*uf1.size(i);
        s.insert({a,b});
    }
    cout << ans-N << "\n";
}