import sequtils, strutils

proc fill(g: seq[seq[int]], i, p, r: int, root, dep: var seq[int]) =
  root[i] = r
  for j in g[i]:
    if j != p:
      dep[j] = dep[i] + 1
      fill(g, j, i, r, root, dep)

proc calc(g: seq[seq[int]], i, p: int, freq: seq[int64], cnt: var seq[int64]) =
  cnt[i] = freq[i]
  for j in g[i]:
    if j != p:
      calc(g, j, i, freq, cnt)
      cnt[i] += cnt[j]

proc solve(g: seq[seq[int]], i, p, r: int, d: int64, cnt: seq[int64], mn: var int64) =
  mn = min(mn, d)
  for j in g[i]:
    if j != p:
      solve(g, j, i, r, d - cnt[j] + (cnt[r] - cnt[j]), cnt, mn)

proc calc_par(g: seq[seq[int]], i, p: int, ppar: var seq[seq[int]]) =
  ppar[0][i] = p
  for j in g[i]:
    if j != p:
      calc_par(g, j, i, ppar)

proc get_lca(aa, bb, r: int, dep: seq[int], ppar: seq[seq[int]]):int =
  var (a, b) = (aa, bb)
  if dep[a] > dep[b]:
    swap(a, b)
  for j in 0..<20:
    if (((dep[b] - dep[a]) shr j) and 1) == 1:
      b = ppar[j][b]
  if a == b:
    return a
  for j in countdown(19, 0):
    if ppar[j][a] != ppar[j][b]:
      a = ppar[j][a]
      b = ppar[j][b]
  return ppar[0][a]

proc main() =
  var n, m, q: int
  (n, m, q) = stdin.readLine.strip.split.map(parseInt)
  var g = newSeqWith(n, newSeq[int]())
  for i in 0..<m:
    var a, b: int
    (a, b) = stdin.readLine.strip.split.map(parseInt)
    g[a - 1].add(b - 1)
    g[b - 1].add(a - 1)
  type P = tuple[a, b: int]
  var pts = newSeq[P](q)
  for i in 0..<q:
    var a, b: int
    (a, b) = stdin.readLine.strip.split.map(parseInt)
    pts[i] = (a - 1, b - 1)

  var 
    root = newSeqWith(n, -1)
    dep = newSeq[int](n)
  for i in 0..<n:
    if root[i] < 0:
      root[i] = i
      fill(g, i, -1, root[i], root, dep)
  var freq = newSeq[int64](n)
  var ans: int64 = 0
  for p in pts:
    let (a, b) = p
    if root[a] == root[b]:
      discard
      # あとで
    else:
      freq[a] += 1
      freq[b] += 1
  var dist = newSeq[int64](n)
  for i in 0..<n:
    dist[root[i]] += dep[i] * freq[i]
  var cnt = newSeq[int64](n)
  for i in 0..<n:
    if i == root[i]:
      calc(g, i, -1, freq, cnt)
      var mn = dist[i]
      solve(g, i, -1, i, dist[i], cnt, mn)
      ans += mn
  
  var ppar = newSeqWith(20, newSeqWith(n, -1))
  for i in 0..<n:
    if i == root[i]:
      calc_par(g, i, -1, ppar)
  for j in 0..<20:
    for i in 0..<n:
      let p = ppar[j][i]
      if p >= 0:
        ppar[j + 1][i] = ppar[j][p]
  for p in pts:
    let (a, b) = p
    if root[a] == root[b]:
      let c = get_lca(a, b, root[a], dep, ppar)
      ans += dep[a] + dep[b] - dep[c] * 2
  echo ans

main()