import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int root(int[] uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = uf.root(uf[u]));
}
bool connect(int[] uf, int u, int v) {
  u = uf.root(u);
  v = uf.root(v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto M = new int[2];
      foreach (s; 0 .. 2) {
        M[s] = readInt();
      }
      auto A = new int[][2];
      auto B = new int[][2];
      foreach (s; 0 .. 2) {
        A[s] = new int[M[s]];
        B[s] = new int[M[s]];
        foreach (i; 0 .. M[s]) {
          A[s][i] = readInt() - 1;
          B[s][i] = readInt() - 1;
        }
      }
      
      auto ufs = new int[][](2, N);
      foreach (s; 0 .. 2) {
        ufs[s][] = -1;
        foreach (i; 0 .. M[s]) {
          ufs[s].connect(A[s][i], B[s][i]);
        }
      }
      
      auto uss = new int[][N];
      foreach (u; 0 .. N) {
        uss[ufs[0].root(u)] ~= u;
      }
      
      long ans;
      auto used = new int[N];
      used[] = -1;
      foreach (r; 0 .. N) {
        if (ufs[0][r] < 0) {
          long num;
          foreach (u; uss[r]) {
            const r1 = ufs[1].root(u);
            if (used[r1] != r) {
              used[r1] = r;
              num += -ufs[1][r1];
            }
          }
          ans += 1L * -ufs[0][r] * num;
        }
      }
      ans -= N;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}