#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (int i=(int)N-1; i>=0; i--)

const ll MOD = pow(10,9)+7;
const ll LLINF = pow(2,61)-1;
const int INF = pow(2,30)-1;

vector<ll> fac;
void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; }
ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; }
ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; }
ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; }
ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

struct UnionFind {
  vector<ll> par, s; 
  UnionFind(ll N) : par(N), s(N) { rep(i,N) { par[i] = i; s[i] = 1; } }
  ll root(ll x) { return par[x]==x ? x : par[x] = root(par[x]); }
  ll size(ll x) { return par[x]==x ? s[x] : s[x] = size(root(x)); }
  void unite(ll x, ll y) { ll rx=root(x), ry=root(y); if (rx!=ry) { s[rx] += s[ry]; par[ry] = rx; } }
  bool same(ll x, ll y) {  ll rx=root(x), ry=root(y); return rx==ry; }
};

// ----------------------------------------------------------------------
// ----------------------------------------------------------------------

int main() {
  ll N, D, W; cin >> N >> D >> W;
  ll a[D], b[D]; rep(i,D) { cin >> a[i] >> b[i]; a[i]--; b[i]--; }
  ll c[W], d[W]; rep(i,W) { cin >> c[i] >> d[i]; c[i]--; d[i]--; }

  UnionFind uf1(N), uf2(N);
  rep(i,D) uf1.unite(a[i], b[i]);
  rep(i,W) uf2.unite(c[i], d[i]);

  map<ll, vector<ll>> m2; rep(i,N) m2[uf2.root(i)].push_back(i);
  ll result = 0;
  rep(i,N) if (uf1.root(i)==i) result += uf1.size(i) * (uf1.size(i)-1);

  for (auto x: m2) { 
    map<ll, ll> m;
    for (auto y: x.second) m[uf1.root(y)]++;
    for (auto y: m) {
      result += uf1.size(y.first) * (uf2.size(x.first)-y.second);
    }
  }
  cout << result << endl;
  return 0;
}