import sys
input = lambda: sys.stdin.readline().rstrip()
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.PA = [-1] * n
    def root(self, a):
        L = []
        while self.PA[a] >= 0:
            L.append(a)
            a = self.PA[a]
        for l in L:
            self.PA[l] = a
        return a
    def unite(self, a, b):
        ra, rb = self.root(a), self.root(b)
        if ra != rb:
            if self.PA[rb] >= self.PA[ra]:
                self.PA[ra] += self.PA[rb]
                self.PA[rb] = ra
            else:
                self.PA[rb] += self.PA[ra]
                self.PA[ra] = rb
    def size(self, a):
        return -self.PA[self.root(a)]
    def groups(self):
        G = [[] for _ in range(self.n)]
        for i in range(self.n):
            G[self.root(i)].append(i)
        return [g for g in G if g]
    def group_size(self):
        G = [[] for _ in range(self.n)]
        for i in range(self.n):
            G[self.root(i)].append(i)
        return [len(g) for g in G if g]

N, D, W = map(int, input().split())
uf1 = UnionFind(N)
uf2 = UnionFind(N)
for _ in range(D):
    a, b = map(int, input().split())
    uf1.unite(a-1, b-1)

for _ in range(W):
    a, b = map(int, input().split())
    uf2.unite(a-1, b-1)

ans = -N
for g in uf1.groups():
    s = len(g)
    S = set()
    for a in g:
        r = uf2.root(a)
        if r not in S:
            S.add(r)
            ans += uf2.size(r) * s

print(ans)