import sys
input = sys.stdin.readline
from collections import *

class Unionfind:
    def __init__(self, n):
        self.par = [-1]*n
        self.rank = [1]*n
    
    def root(self, x):
        r = x
        
        while not self.par[r]<0:
            r = self.par[r]
        
        t = x
        
        while t!=r:
            tmp = t
            t = self.par[t]
            self.par[tmp] = r
        
        return r
    
    def unite(self, x, y):
        rx = self.root(x)
        ry = self.root(y)
        
        if rx==ry:
            return
        
        if self.rank[rx]<=self.rank[ry]:
            self.par[ry] += self.par[rx]
            self.par[rx] = ry
            
            if self.rank[rx]==self.rank[ry]:
                self.rank[ry] += 1
        else:
            self.par[rx] += self.par[ry]
            self.par[ry] = rx
    
    def is_same(self, x, y):
        return self.root(x)==self.root(y)
    
    def count(self, x):
        return -self.par[self.root(x)]

N, D, W = map(int, input().split())
uf1 = Unionfind(N)
uf2 = Unionfind(N)

for _ in range(D):
    a, b = map(int, input().split())
    uf1.unite(a-1, b-1)

for _ in range(W):
    c, d = map(int, input().split())
    uf2.unite(c-1, d-1)

d = defaultdict(set)

for i in range(N):
    d[uf1.root(i)].add(uf2.root(i))

cnt = defaultdict(int)

for k in d:
    for v in d[k]:
        cnt[k] += uf2.count(v)

ans = 0

for i in range(N):
    ans += cnt[uf1.root(i)]-1

print(ans)