#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <list>

using namespace std;

typedef pair<int, int> PII;

class UnionFind {
private:
	// parents[i] >= 0 なら i の親
	// parents[i] < 0 で、根。abs(parents[i])がその木に属する頂点数
	vector<int> parents;
	map<int, list<int>> groups;

public:
	UnionFind();
	UnionFind(int n) {
		parents.assign(n, -1);
		for (int i = 0; i < n; i++) {
			groups[i] = {i};
		}
	}
	~UnionFind() {
		parents.clear();
		groups.clear();
	};

	int find(int x) {
		if (parents[x] < 0) {
			return x;
		} else {
			return parents[x] = find(parents[x]);
		}
	}

	void unite(int x, int y) {
		x = find(x);
		y = find(y);

		if (x == y) {
			return;
		}

		if (size(x) < size(y)) {
			swap(x, y);
		}

		parents[x] += parents[y];
		parents[y] = x;
		groups[x].insert(groups[x].end(), groups[y].begin(), groups[y].end());
		groups.erase(y);
		return ;
	}

	bool same(int x, int y) {
		return find(x) == find(y);
	}

	int size(int x) {
		return -parents[find(x)];
	}

	list<int> getGroup(int x) {
		return groups[x];
	}
};

int main() {
	int n, m, q;

	cin >> n >> m >> q;
	vector<int> a(m), b(m), c(q), d(q);
	for (int i = 0; i < m; i++) {
		cin >> a[i] >> b[i];
		a[i]--;
		b[i]--;
	}

	set<PII> eaten;
	for (int i = 0; i < q; i++) {
		cin >> c[i] >> d[i];
		c[i]--;
		d[i]--;
		eaten.insert(make_pair(c[i], d[i]));
	}

	UnionFind uf(n);
	for (int i = 0; i < m; i++) {
		if (eaten.count(make_pair(a[i], b[i])) == 0) {
			uf.unite(a[i], b[i]);
		}
	}

	vector<int> ans(n, 0);
	for (int i = 0; i < n; i++) {
		if (uf.same(0, i)) {
			ans[i] = -1;
		}
	}

	for (int i = q - 1; i >= 0; i--) {
		bool connects_c = uf.same(0, c[i]);
		bool connects_d = uf.same(0, d[i]);
		if (connects_c == connects_d) {
			uf.unite(c[i], d[i]);
			continue;
		}

		int n_connect = uf.size(0);
		int which = connects_c ? d[i] : c[i];
		auto tmp = uf.getGroup(uf.find(which));
		uf.unite(c[i], d[i]);
		if (uf.size(0) != n_connect) {
			for (auto e : tmp) {
				ans[e] = i + 1;
			}
		}
	}

	for (int i = 1; i < n; i++) {
		cout << ans[i] << endl;
	}
	return 0;
}