/* -*- coding: utf-8 -*-
 *
 * 922.cc:  No.922 東北きりきざむたん - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int BN = 17;
const long long LINF = 1LL << 62;

/* typedef */

typedef long long ll;
typedef vector<int> vi;
typedef queue<int> qi;

/* global variables */

vi nbrs[MAX_N];
int gids[MAX_N], ds[MAX_N], ps[MAX_N][BN], cns[MAX_N], vns[MAX_N], gvns[MAX_N];
ll es[MAX_N], pes[MAX_N], ges[MAX_N];

/* subroutines */

int lca(int u, int v) {
  if (ds[u] > ds[v]) swap(u,v);

  for (int i = BN - 1; i >= 0; i--)
    if (((ds[v] - ds[u]) >> i) & 1) v = ps[v][i];
  if (u == v) return u;

  for(int i = BN - 1; i >= 0; i--)
    if (ps[u][i] != ps[v][i]) {
      u = ps[u][i];
      v = ps[v][i];
    }
  
  return ps[u][0];
}

/* main */

int main() {
  int n, m, qn;
  scanf("%d%d%d", &n, &m, &qn);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    nbrs[u].push_back(v);
    nbrs[v].push_back(u);
  }

  memset(gids, -1, sizeof(gids));
  int gn = 0;
  qi q;

  for (int st = 0; st < n; st++)
    if (gids[st] < 0) {
      int id = gn++;
      ds[st] = 0;
      ps[st][0] = -1;

      q.push(st);

      while (! q.empty()) {
	int u = q.front(); q.pop();
	int vd = ds[u] + 1, &up = ps[u][0];

	gids[u] = id;
	for (int i = 0; i < BN - 1; i++)
	  ps[u][i + 1] = (ps[u][i] >= 0) ? ps[ps[u][i]][i]: -1;

	vi &nbru = nbrs[u];
	for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
	  int &v = *vit;
	  if (v != up) {
	    cns[u]++;
	    ds[v] = vd;
	    ps[v][0] = u;
	    q.push(v);
	  }
	}
      }
    }
  //printf("gn=%d\n", gn);

  ll sum = 0;
  for (int i = 0; i < qn; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;

    if (gids[a] == gids[b]) {
      int c = lca(a, b);
      sum += ds[a] + ds[b] - 2 * ds[c];
    }
    else {
      vns[a]++;
      vns[b]++;
    }
  }
  //printf("%lld\n", sum);

  for (int u = 0; u < n; u++)
    if (cns[u] == 0) q.push(u);

  while (! q.empty()) {
    int u = q.front(); q.pop();
    int &up = ps[u][0];

    if (up >= 0) {
      vns[up] += vns[u];
      es[up] += es[u] + vns[u];
      if (--cns[up] == 0) q.push(up);
    }
    else
      gvns[gids[u]] = vns[u];
  }

  fill(ges, ges + gn, LINF);
  
  for (int st = 0; st < n; st++)
    if (ps[st][0] < 0) {
      q.push(st);

      while (! q.empty()) {
	int u = q.front(); q.pop();
	int up = ps[u][0], id = gids[u];
	ll esum = pes[u] + (gvns[id] - vns[u]) + es[u];
	if (ges[id] > esum) ges[id] = esum;
	
	vi &nbru = nbrs[u];
	for (vi::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
	  int &v = *vit;
	  if (v != up) {
	    pes[v] = esum - (es[v] + vns[v]);
	    q.push(v);
	  }
	}
      }
    }

  for (int i = 0; i < gn; i++) sum += ges[i];
  printf("%lld\n", sum);
  return 0;
}