import sys
input = sys.stdin.readline

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

    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 union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

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

    def get_size(self, x):
        x = self.find(x)
        return self.size[x]
    
    
N, D, W = map(int, input().split())
Ux, Uy = UnionFind(N), UnionFind(N)
for i in range(D):
    a, b = map(int, input().split())
    a, b = a - 1, b - 1
    Ux.union(a, b)
for i in range(W):
    a, b = map(int, input().split())
    a, b = a - 1, b - 1
    Uy.union(a, b)
    
S = set()
mem = [[] for i in range(N)]
for i in range(N):
    mem[Ux.find(i)].append(i)
    
ans = 0
for i in range(N):
    uxi = Ux.find(i)
    if uxi in S:
        continue
    S.add(uxi)
    temp = set()
    for u in mem[uxi]:
        temp.add(Uy.find(u))
    cnt = -1
    for u in temp:
        cnt += Uy.get_size(u)
    ans += len(mem[uxi]) * cnt
    
print(ans)