#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

struct UnionFind {
	vector<int> data;
	void init(int n) { data.assign(n, -1); }
	bool unionSet(int x, int y) {
		x = root(x); y = root(y);
		if(x != y) {
			if(data[y] < data[x]) swap(x, y);
			data[x] += data[y]; data[y] = x;
		}
		return x != y;
	}
	bool findSet(int x, int y) { return root(x) == root(y); }
	int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
	int size(int x) { return -data[root(x)]; }
};

int main() {
	int N; int M; int Q;
	while(~scanf("%d%d%d", &N, &M, &Q)) {
		set<pii> edges;
		rep(i, M) {
			int A; int B;
			scanf("%d%d", &A, &B), -- A, -- B;
			if(A > B)swap(A, B);
			edges.insert(make_pair(A, B));
		}
		vpii queries(Q);
		rep(i, Q) {
			int A; int B;
			scanf("%d%d", &A, &B), -- A, -- B;
			if(A > B)swap(A, B);
			edges.erase(make_pair(A, B));
			queries[i] = make_pair(A, B);
		}
		UnionFind uf;
		uf.init(N);
		for(auto e : edges)
			uf.unionSet(e.first, e.second);
		vector<int> ans(N, 0);
		rep(i, N) if(uf.findSet(i, 0))
			ans[i] = -1;
		vector<vi> as(N);
		rep(i, N)
			as[uf.root(i)].push_back(i);
		for(int i = Q - 1; i >= 0; -- i) {
			auto e = queries[i];
			int x = e.first, y = e.second;
			x = uf.root(x), y = uf.root(y);
			if(x == y) continue;
			if(uf.findSet(0, y))
				swap(x, y);
			vi &v = as[x], &w = as[y];
			if(uf.findSet(0, x)) {
				for(int j : w)
					ans[j] = i + 1;
			}
			if(v.size() < w.size())
				v.swap(w);
			v.insert(v.end(), w.begin(), w.end());
			w.clear();
			uf.unionSet(x, y);
			as[uf.root(x)].swap(v);
		}
		for(int i = 1; i < N; ++ i)
			printf("%d\n", ans[i]);
	}
	return 0;
}