from sys import setrecursionlimit, stdin


def find(parent, i):
    t = parent[i]
    if t < 0:
        return i
    t = find(parent, t)
    parent[i] = t
    return t


def unite(parent, i, j):
    i = find(parent, i)
    j = find(parent, j)
    if i == j:
        return
    parent[j] += parent[i]
    parent[i] = j


readline = stdin.readline
setrecursionlimit(10 ** 6)

N, D, W = map(int, readline().split())

car = [-1] * N
for _ in range(D):
    a, b = map(lambda x: int(x) - 1, readline().split())
    unite(car, a, b)

walking = [-1] * N
for _ in range(W):
    c, d = map(lambda x: int(x) - 1, readline().split())
    unite(walking, c, d)

ss0 = {}
xs = [i for i in range(N) if car[i] < 0]
for x in xs:
    ss0[x] = set()
for i in range(N):
    ss0[find(car, i)].add(i)

ss1 = {}
ys = [i for i in range(N) if walking[i] < 0]
for y in ys:
    ss1[y] = set()
for i in range(N):
    ss1[find(walking, i)].add(i)

result = 0
for x in xs:
    t = ss0[x].copy()
    for i in set(find(walking, z) for z in ss0[x]):
        t |= ss1[i]
    result += len(ss0[x]) * (len(t) - 1)
print(result)