class UnionFind:
    def __init__(self, n):
        self.par = [i for i in range(n+1)]
        self.rank = [0] * (n + 1)
        self.size = [1] * (n + 1)

    # 検索
    def find(self, x):
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    # 併合
    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.rank[x] < self.rank[y]:
            self.par[x] = y
            self.size[y] += self.size[x]
        else:
            self.par[y] = x
            self.size[x] += self.size[y]
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1

    # 同じ集合に属するか判定
    def same_check(self, x, y):
        return self.find(x) == self.find(y)


n, d, w = map(int, input().split())
ufd = UnionFind(n)
ufw = UnionFind(n)
for i in range(d):
    a, b = map(int, input().split())
    ufd.unite(a - 1, b - 1)
for i in range(w):
    c, d = map(int, input().split())
    ufw.unite(c - 1, d - 1)
s = set()
for i in range(n):
    s.add((ufd.find(i), ufw.find(i)))
ans = 0
for p, q in s:
    ans += ufd.size[p] * ufw.size[q]
print(ans - n)