#include <bits/stdc++.h>
using namespace std;

struct LCA {
  vector<int> dpt;
  vector<vector<int>> par;
  LCA(const vector<vector<int>> &g, vector<int> roots) {
    int n = g.size();
    int lgn = 32 - __builtin_clz(n);
    dpt.resize(n);
    par.assign(lgn, vector<int>(n, -1));
    function<void(int, int)> dfs = [&](int u, int fa) {
      for (int v : g[u]) if (v != fa) {
        dpt[v] = dpt[u] + 1;
        par[0][v] = u;
        dfs(v, u);
      }
    };
    for (int root : roots) dfs(root, -1);
    for (int i = 0; i + 1 < lgn; ++i) {
      for (int u = 0; u < n; ++u) {
        int p = par[i][u];
        if (~p) par[i + 1][u] = par[i][p];
      }
    }
  }
  int query(int u, int v) {
    if (dpt[u] > dpt[v]) swap(u, v);
    for (int i = par.size() - 1; ~i; --i) if (dpt[v] - dpt[u] >= 1 << i) {
      v = par[i][v];
    }
    if (u == v) return u;
    for (int i = par.size() - 1; par[0][u] != par[0][v]; --i) {
      if (par[i][u] != par[i][v]) {
        u = par[i][u];
        v = par[i][v];
      }
    }
    assert(par[0][u] == par[0][v]);
    return par[0][u];
  }
};

int main() {
  int N, M, Q; {
    cin >> N >> M >> Q;
  }

  vector<vector<int>> G(N); {
    for (int i = 0; i < M; ++i) {
      int u, v; {
        cin >> u >> v;
        --u, --v;
      }
      G[u].push_back(v);
      G[v].push_back(u);
    }
  }

  vector<int> A(Q), B(Q); {
    for (int i = 0; i < Q; ++i) cin >> A[i] >> B[i], --A[i], --B[i];
  }

  vector<int> roots;
  vector<int> ccid(N, -1); {
    for (int u = 0; u < N; ++u) if (ccid[u] == -1) {
      ccid[u] = roots.size();
      roots.push_back(u);
      function<void(int, int)> dfs = [&](int u, int p) {
        for (int v : G[u]) if (v != p) ccid[v] = ccid[u], dfs(v, u);
      };
      dfs(u, -1);
    }
  }

  LCA lca(G, roots);

  int64_t res = 0; {
    vector<int64_t> swei(N);
    vector<int64_t> sdis(N); {
      for (int i = 0; i < Q; ++i) {
        if (ccid[A[i]] == ccid[B[i]]) {
          auto dis = [&lca](int u, int v) {
            return lca.dpt[u] + lca.dpt[v] - lca.dpt[lca.query(u, v)];
          };
          res += dis(A[i], B[i]);
        } else {
          swei[A[i]] += 1;
          swei[B[i]] += 1;
        }
      }
    }
    
    for (int root : roots) {
      function<void(int, int)> dfs1 = [&](int u, int p) {
        for (int v : G[u]) if (v != p) dfs1(v, u);
        for (int v : G[u]) if (v != p) swei[u] += swei[v], sdis[u] += sdis[v] + swei[v];
      };
      dfs1(root, -1);
      res += sdis[root];
      function<void(int, int, int)> dfs2 = [&](int u, int p, int upsize) {
        for (int v : G[u]) if (v != p) {
          int nupsize = upsize + swei[u] - swei[v];
          if (swei[v] > nupsize) res -= swei[v] - nupsize, dfs2(v, u, nupsize);
        }
      };
      dfs2(root, -1, 0);
    }
  }

  cout << res << endl;
}