class UnionFindNode:
    def __init__(self, group_id, parent=None, value=None):
        self.group_id_ = group_id
        self.parent_ = parent
        self.value = value
        self.rank_ = 1
        self.member_num_ = 1

    def is_root(self):
        return not self.parent_

    def root(self):
        parent = self
        while not parent.is_root():
            parent = parent.parent_
            self.parent_ = parent
        return parent

    def find(self):
        root = self.root()
        return root.group_id_

    def rank(self):
        root = self.root()
        return root.rank_

    def unite(self, unite_node):
        root = self.root()
        unite_root = unite_node.root()

        if root.group_id_ != unite_root.group_id_:
            if root.rank() > unite_root.rank():
                n_root, child = root, unite_root
            else:
                n_root, child = unite_root, root
            child.parent_ = n_root
            n_root.rank_ = max(n_root.rank_, child.rank_ + 1)
            n_root.member_num_ = n_root.member_num_ + child.member_num_

if __name__ == "__main__":
    import sys;input=sys.stdin.readline
    N, D, W = map(int, input().split())
    nodes1 = [UnionFindNode(i) for i in range(N+1)]
    for _ in range(D):
        a, b = map(int, input().split())
        nodes1[a].unite(nodes1[b])
    nodes2 = [UnionFindNode(i) for i in range(N+1)]
    for _ in range(W):
        a, b = map(int, input().split())
        nodes2[a].unite(nodes2[b])

    R = 0
    vs = set()
    from collections import defaultdict
    X = defaultdict(int)
    D = defaultdict(set)
    for i in range(1, N+1):
        x, y = nodes1[i].root().group_id_, nodes2[i].root().group_id_
#        if x in vs:
#            continue
#        vs.add(x)
        if y in D[x]:
            continue
        D[x].add(y)
        X[x] += nodes2[y].member_num_
#    print(D)
    for x in D:
        R += nodes1[x].member_num_ * (X[x]-1)
    print(R)