/* -*- coding: utf-8 -*-
 *
 * 1293.cc:  No.1293 2種類の道路 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;

/* typedef */

typedef long long ll;
typedef vector<int> vi;

struct UFT {
  int links[MAX_N], ranks[MAX_N], sizes[MAX_N];
  UFT() {}

  void init(int n) {
    for (int i = 0; i < n; i++) links[i] = i, ranks[i] = sizes[i] = 1;
  }

  int root(int i) {
    int i0 = i;
    while (links[i0] != i0) i0 = links[i0];
    return (links[i] = i0);
  }

  int rank(int i) { return ranks[root(i)]; }
  int size(int i) { return sizes[root(i)]; }
  bool same(int i, int j) { return root(i) == root(j); }

  int merge(int i0, int i1) {
    int r0 = root(i0), r1 = root(i1), mr;
    if (r0 == r1) return r0;
    if (ranks[r0] == ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      ranks[r0]++;
      mr = r0;
    }
    else if (ranks[r0] > ranks[r1]) {
      links[r1] = r0;
      sizes[r0] += sizes[r1];
      mr = r0;
    }
    else {
      links[r0] = r1;
      sizes[r1] += sizes[r0];
      mr = r1;
    }
    return mr;
  }
};

/* global variables */

UFT uft0, uft1;
int ids0[MAX_N], ids1[MAX_N];
int szs0[MAX_N], szs1[MAX_N];
vi us[MAX_N];

/* subroutines */

int calcg(int n, int m, UFT &uft, int ids[], int szs[]) {
  uft.init(n);
  fill(ids, ids + n, -1);

  for (int i = 0; i < m; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;
    uft.merge(a, b);
  }

  int gn = 0;
  for (int i = 0; i < n; i++) {
    int ri = uft.root(i);
    if (ids[ri] < 0) {
      szs[gn] = uft.size(ri);
      ids[ri] = gn++;
    }
  }
  return gn;
}

/* main */

int main() {
  int n, d, w;
  scanf("%d%d%d", &n, &d, &w);

  int gn0 = calcg(n, d, uft0, ids0, szs0);
  int gn1 = calcg(n, w, uft1, ids1, szs1);

  for (int i = 0; i < n; i++) {
    int id0 = ids0[uft0.root(i)];
    int id1 = ids1[uft1.root(i)];
    us[id0].push_back(id1);
  }

  ll sum = 0;
  for (int i = 0; i < gn0; i++) {
    vi &ui = us[i];
    sort(ui.begin(), ui.end());
    int l = ui.size();

    for (int j = 0; j < l;) {
      int k = j + 1;
      while (k < l && ui[j] == ui[k]) k++;
      sum += (ll)szs0[i] * szs1[ui[j]] - (k - j);
      j = k;
    }
  }

  printf("%lld\n", sum);
  return 0;
}