import sys
from collections import deque
def MI(): return map(int,sys.stdin.readline().rstrip().split())


N,D,W = MI()
Graph0 = [[] for _ in range(N+1)]
for _ in range(D):
    a,b = MI()
    Graph0[a].append(b)
    Graph0[b].append(a)
Graph1 = [[] for _ in range(N+1)]
for _ in range(W):
    c,d = MI()
    Graph1[c].append(d)
    Graph1[d].append(c)

count = []  # 各連結成分の要素数
X = [-1]*(N+1)  # 各頂点が何番目の連結成分に属しているか
a = 0
for i in range(1,N+1):
    if X[i] != -1:
        continue
    deq = deque([i])
    X[i] = a
    c = 1
    while deq:
        j = deq.pop()
        for k in Graph0[j]:
            if X[k] == -1:
                X[k] = a
                deq.append(k)
                c += 1
    count.append(c)
    a += 1

ans = 0
flag = [0]*(N+1)
for i in range(1,N+1):
    if flag[i] == 1:
        continue
    A = []
    deq = deque([i])
    flag[i] = 1
    A.append(X[i])
    c = 1
    while deq:
        j = deq.pop()
        for k in Graph1[j]:
            if flag[k] == 0:
                flag[k] = 1
                deq.append(k)
                A.append(X[k])
                c += 1
    A = list(set(A))
    for a in A:
        ans += c*count[a]

print(ans-N)