#include <bits/stdc++.h>
using namespace std;
typedef long long   signed int LL;
typedef long long unsigned int LU;
#define incID(i, l, r) for(LL i = (l)    ; i <  (r); ++i)
#define incII(i, l, r) for(LL i = (l)    ; i <= (r); ++i)
#define decID(i, l, r) for(LL i = (r) - 1; i >= (l); --i)
#define decII(i, l, r) for(LL i = (r)    ; i >= (l); --i)
#define inc(i, n)  incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec(i, n)  decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))
#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
template<typename T> bool setmin  (T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmax  (T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
LL mo(LL a, LL b) { assert(b > 0); a %= b; if(a < 0) { a += b; } return a; }
LL fl(LL a, LL b) { assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
LL ce(LL a, LL b) { assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define bit(b, i) (((b) >> (i)) & 1)
#define BC __builtin_popcountll
#define SC static_cast
#define SI(v) SC<int>(v.size())
#define SL(v) SC<LL >(v.size())
#define RF(e, v) for(auto & e: v)
#define ef else if
#define UR assert(false)

// ---- ----

class UnionFind {
private:
	int n, s;
	vector<int> t;
	vector<vector<int>> v;
public:
	UnionFind(int arg_n = 0) { init(arg_n); }
	void init(int arg_n) {
		n = s = arg_n;
		t.clear();
		v.clear();
		inc(i, n) { t.PB(i); v.EB(1, i); }
	}
	int get_n() { return n; }
	int size() { return s; }
	int id(int x) { return t.at(x); }
	const vector<vector<int>> & get_v() { return v; }
	bool unite(int x, int y) {
		x = id(x);
		y = id(y);
		if(x == y) { return false; }
		if(v[x].size() < v[y].size()) { swap(x, y); }
		for(auto & e: v[y]) { v[x].PB(e); t[e] = x; }
		v[y].clear();
		s--;
		return true;
	}
	bool same(int x, int y) { return (id(x) == id(y)); }
	const vector<int> & operator[](int x) { return v[id(x)]; }
	friend ostream & operator<<(ostream & os, const UnionFind & uf) {
		inc(i, uf.n) { os << i << ": "; for(auto & e: uf.v[i]) { os << e << " "; } os << "\n"; }
		return os;
	}
};

// ---- ----

const int M = 100000;
LL n, m, q, c[M], s[M];
vector<int> g[M];


// ----

const int N = 100000;
const int B = 17;
int h[N], p[B][N];
void dfs(int v, int pp, int hh) {
	h[v] = hh;
	p[0][v] = pp;
	for(auto && e: g[v]) {
		if(e == pp) { continue; }
		dfs(e, v, h[v] + 1);
	}
}
void pre(const vector<int> & root) {
	RF(e, root) { dfs(e, -1, 0); }
	inc(k, B - 1) {
	inc(i, n) {
		p[k + 1][i] = p[k][p[k][i]];
	}
	}
}
int lca(int a, int b) {
	if(! (h[a] <= h[b])) { swap(a, b); }
	int d = h[b] - h[a];
	inc(k, B) { if(bit(d, k)) { b = p[k][b]; } }
	if(a == b) { return a; }
	
	dec(k, B) {
		int pa = p[k][a];
		int pb = p[k][b];
		if(pa != pb) { a = pa; b = pb; }
	}
	assert(p[0][a] == p[0][b]);
	
	return p[0][a];
}

int dist(int a, int b) {
	int m = lca(a, b);
	return h[a] + h[b] - 2 * h[m];
}

// ----

void dfs1(int v, int p) {
	RF(e, g[v]) {
		if(e == p) { continue; }
		dfs1(e, v);
		c[v] += c[e];
		s[v] += s[e] + c[e];
	}
}

void dfs2(int v, int p, int r, LL & mi) {
	if(p != -1) { s[v] = s[p] + c[r] - 2 * c[v]; }
	setmin(mi, s[v]);
	RF(e, g[v]) {
		if(e == p) { continue; }
		dfs2(e, v, r, mi);
	}
}

int main() {
	cin >> n >> m >> q;
	UnionFind uf(n);
	inc(i, m) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		g[a].PB(b);
		g[b].PB(a);
		uf.unite(a, b);
	}
	
	vector<int> root;
	RF(e, uf.get_v()) {
		if(SI(e) == 0) { continue; }
		root.PB(e[0]);
	}
	
	pre(root);
	
	LL ans = 0;
	inc(i, q) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		if(uf.same(a, b)) {
			ans += dist(a, b);
		} else {
			c[a]++;
			c[b]++;
		}
	}
	
	RF(e, root) { dfs1(e, -1); }
	RF(e, root) {
		LL x = 1e18;
		dfs2(e, -1, e, x);
		ans += x;
	}
	
	cout << ans << endl;
	
	return 0;
}