#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

class UnionFind{
  int n;
  vector<int> data;
public:
  UnionFind(int _n):n(_n),data(_n,-1){}
  bool link(int a, int b){ //if new link, then true.
    int ra=find_root(a);
    int rb=find_root(b);
    if(ra!=rb){
      if(data[rb]<data[ra]) swap(ra,rb);
      data[ra]+=data[rb];
      data[rb]=ra;
    }
    return (ra!=rb);
  }
  bool check(int a, int b){ //if same set, then true.
    return (find_root(a)==find_root(b));
  }
  int find_root(int a){
    return ((data[a]<0)?a:(data[a]=find_root(data[a])));
  }
};


int main(){
  int N, D, W;
  cin >> N >> D >> W;
  vector<pair<int,int>> v, w;
  rep(i,D){
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    v.emplace_back(a,b);
  }
  rep(i,W){
    int a, b;
    cin >> a >> b;
    a--;
    b--;
    w.emplace_back(a,b);
  }

  UnionFind red(N);
  rep(i,D){
    red.link(v[i].first, v[i].second);
  }
  UnionFind blue(N);
  rep(i,W){
    blue.link(w[i].first, w[i].second);
  }
  map<int,map<int,int>> belong_blue;
  map<int,int> num_blue, num_red;
  rep(i,N){
    belong_blue[blue.find_root(i)][red.find_root(i)]++;
    num_blue[blue.find_root(i)]++;
    num_red[red.find_root(i)]++;
  }

  ll ret = 0;
  FOR(it,belong_blue){
    int bi = it->first;
    map<int,int>& m = it->second;

    ll nb = num_blue[bi];
    ll nr = 0;
    FOR(it2,m){
      nr += num_red[it2->first];
    }
    ret += nb * nr;
  }

  ret -= N;
  
  cout << ret << endl;
  
  
  return 0;
}