class UnionFind:
    def __init__(self, n):
        self.parent = list(range(n))
        self.size = [1] * n

    def find(self, n):
        if self.parent[n] == n:
            return n
        self.parent[n] = self.find(self.parent[n])
        return self.parent[n]

    def merge(self, m, n):
        m = self.find(m)
        n = self.find(n)
        if m == n:
            return
        if m > n:
            m, n = n, m
        self.parent[m] = n
        self.size[n] += self.size[m]


n, d, w = map(int, input().split())
x = UnionFind(n)
y = UnionFind(n)
for i in range(d):
    a, b = map(int, input().split())
    x.merge(a - 1, b - 1)
for i in range(w):
    a, b = map(int, input().split())
    y.merge(a - 1, b - 1)

s = set()
for i in range(n):
    s.add((x.find(i), y.find(i)))
ans = -n
for a, b in s:
    ans += x.size[a] * y.size[b]
print(ans)