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

struct UnionFind {
	vector<int> parent;
	vector<vector<int>> group;

	UnionFind(int n) : parent(n), group(n) {
		for (int i = 0; i < n; i++) {
			parent[i] = i;
			group[i].push_back(i);
		}
	}

	int operator[](int x) {
		if (parent[x] == x) return x;
		return parent[x] = operator[](parent[x]);
	}

	bool merge(int x, int y) {
		x = operator[](x);
		y = operator[](y);
		if (x == y) return false;
		if (x > y) swap(x, y);
		if (group[x].size() < group[y].size()) swap(group[x], group[y]);
		for (int e : group[y]) group[x].push_back(e);
		parent[y] = x;
		return true;
	}
};

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

	set<pair<int, int>> g;

	for (int i = 0; i < m; i++) {
		int a, b;
		scanf("%d %d", &a, &b);
		a--; b--;
		g.emplace(minmax(a, b));
	}

	vector<int> c(q), d(q);
	for (int i = 0; i < q; i++) {
		scanf("%d %d", &c[i], &d[i]);
		c[i]--; d[i]--;
		g.erase(minmax(c[i], d[i]));
	}

	UnionFind uf(n);
	for (auto e : g) {
		uf.merge(e.first, e.second);
	}

	vector<int> ans(n);

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

	for (int i = q - 1; i >= 0; i--) {
		c[i] = uf[c[i]];
		d[i] = uf[d[i]];
		if (c[i] > d[i]) swap(c[i], d[i]);
		if (c[i] != d[i]) {
			if (c[i] == 0) {
				for (int e : uf.group[d[i]]) {
					ans[e] = i + 1;
				}
			}
			uf.merge(c[i], d[i]);
		}
	}

	for (int i = 1; i < n; i++) {
		printf("%d\n", ans[i]);
	}
}