import sys

input = sys.stdin.buffer.readline


class UnionFind:
    __slots__ = ["n", "parent", "height", "size"]

    def __init__(self, n):
        self.n = n
        self.parent = [i for i in range(n)]
        self.height = [1] * n
        self.size = [1] * n

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

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.height[x] < self.height[y]:
                self.parent[x] = y
                self.size[y] += self.size[x]
            else:
                self.parent[y] = x
                self.size[x] += self.size[y]
                if self.height[x] == self.height[y]:
                    self.height[x] += 1

    def issame(self, x, y):
        return self.find(x) == self.find(y)

    def group_size(self, x):
        return self.size[self.find(x)]


N, D, W = map(int, input().split())
uf_d = UnionFind(N)
for _ in range(D):
    a, b = (int(x) - 1 for x in input().split())
    uf_d.unite(a, b)
uf_w = UnionFind(N)
for _ in range(W):
    c, d = (int(x) - 1 for x in input().split())
    uf_w.unite(c, d)

ans = -N

root_pair_set = set()
for i in range(N):
    root_d = uf_d.find(i)
    root_w = uf_w.find(i)
    if (root_d, root_w) in root_pair_set:
        continue
    root_pair_set.add((root_d, root_w))
    ans += uf_d.size[root_d] * uf_w.size[root_w]
print(ans)