import sys
r = sys.stdin

N,D,W = map(int,r.readline().split())
G = [[] for _ in range(N+1)]
for _ in range(D):
    a,b = map(int,r.readline().split())
    G[a].append(b)
    G[b].append(a)

parent = [-1] * (N + 1)

sys.setrecursionlimit(10 ** 8)
def find(i):
    if parent[i] < 0:return i
    parent[i] = find(parent[i])
    return parent[i]
def unite(i,j):
    I = find(i)
    J = find(j)
    if I == J:
        return False
    if parent[I] < parent[J]:
        I,J = J,I
    parent[J] += parent[I]
    parent[I] = J
    return True
for _ in range(W):
    c,d = map(int,r.readline().split())
    unite(c,d)
renketu = []
memo = [0] * (N + 1)
def dfs(now):
    global ans
    ans.append(now)
    memo[now] = 1
    for v in G[now]:
        if memo[v] == 0:
            dfs(v)
for i in range(1,N+1):
    if memo[i] == 0:
        ans = []
        dfs(i)
        renketu.append(ans)
ans = 0
for R in renketu:
    s = set()
    for v in R:
        if find(v) not in s:
            s.add(find(v))
            ans += len(R) * (-parent[find(v)])
    ans -= len(R)
print(ans)