//考察10分、実装10分、デバッグたくさん (同じ木の間の移動を見落とし、その他実装上の見落とし）
#include <iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(i = 0; i < n; i++)
#define int long long
using namespace std;

int n, m, q;
vector<int> et[100000];
int vcost[100000];

bool used[100000];
int treeSum[100000];
int parent[100000];
int depth[100000];
int dfs(int p, int v, int dep) {
	int i;
	
	used[v] = true;
	parent[v] = p;
	depth[v] = dep;
	int ret = vcost[v];
	rep(i, et[v].size()) {
		int nv = et[v][i];
		if (nv == p) continue;
		ret += dfs(v, nv, dep + 1);
	}
	return treeSum[v] = ret;
}

int calcInitCost(int p, int v) {
	int i;
	
	int ret = 0;
	rep(i, et[v].size()) {
		int nv = et[v][i];
		if (nv == p) continue;
		ret += calcInitCost(v, nv);
	}
	ret += treeSum[v];
	return ret;
}

int sumcost[100000];
int rt;
int dfs2(int p, int v, int sumCost) {
	int i;
	
	sumcost[v] = sumCost;
	if (p != -1 && et[v].size() == 1) { return sumCost; }
	
	int ret = sumCost;
	rep(i, et[v].size()) {
		int nv = et[v][i];
		if (nv == p) continue;
		int res = dfs2(v, nv, sumCost + treeSum[rt] - 2 * treeSum[nv]);
		ret = min(ret, res);
	}
	return ret;
}

//
struct UF {
	int par[100000];
	UF() { int i; rep(i, 100000) par[i] = i; }
	int root(int x) { if (par[x] == x) return x; return par[x] = root(par[x]); }
	void unit(int x, int y) { x = root(x); y = root(y); par[x] = y; }
	bool same(int x, int y) { return root(x) == root(y); }
};

int parents[20][100000];
UF uf;

int lca(int a, int b) {
	if (depth[a] < depth[b]) {
		swap(a, b);
	}
	
	int i;
	int diff = depth[a] - depth[b];
	rep(i, 20) {
		if ((diff >> i) & 1) {
			a = parents[i][a];
		}
	}
	
	for (i = 19; i >= 0; i--) {
		if (parents[i][a] != parents[i][b]) {
			a = parents[i][a];
			b = parents[i][b];
		}
	}
	if (a == b) return a;
	return parent[a];
}

signed main() {
	int i;
	
	cin >> n >> m >> q;
	rep(i, m) {
		int u, v;
		cin >> u >> v;
		u--; v--;
		et[u].push_back(v);
		et[v].push_back(u);
		uf.unit(u, v);
	}
	
	rep(i, n) {
		if (used[i]) continue;
		dfs(-1, i, 0);
	}
	
	rep(i, n) parents[0][i] = parent[i];
	
	rep(i, 19) {
		int j;
		rep(j, n) {
			parents[i + 1][j] = parents[i][parents[i][j]];
		}
	}
	
	int ans1 = 0;
	rep(i, q) {
		int a, b;
		cin >> a >> b;
		a--; b--;
		
		if (uf.same(a, b)) {
			int l = lca(a, b);
			ans1 += depth[a] + depth[b] - 2 * depth[l];
			continue;
		}
		
		vcost[a]++;
		vcost[b]++;
	}
	
	//rep(i, n) { cout << "vcost[" << i + 1 << "] = " << vcost[i] << endl; }
	
	rep(i, n) { used[i] = false; }
	
	int ans2 = 0;
	rep(i, n) {
		if (used[i]) continue;
		
		//cout << "i = " << i << endl;
		dfs(-1, i, 0);
		
		int initCost = calcInitCost(-1, i);
		initCost -= treeSum[i];
		
		rt = i;
		int res = dfs2(-1, i, initCost);
		ans2 += res;
	}
	
	/*rep(i, n) {
		cout << "v = " << i + 1 << ", treeSum = " << treeSum[i] << ", sumcost = " << sumcost[i] << endl;
	}*/
	cout << ans1 + ans2 << endl;
	return 0;
}