#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <utility>
#include <stack>
#include <queue>
#include <sstream>
#include <fstream>
#include <cstring>

using namespace std;

int N, M, Q;

vector<pair<int, int>> bridges, queries;
map<int, bool> a[100010];
int answer[100010];

int id[100010];
vector<int> group[100010];

void init(int sz)
{
	for (int i = 0; i < sz; i++)
	{
		id[i] = i;
		group[i].push_back(i);
	}
}

void merge(int a, int b, int query_num = 0)
{
	a = id[a], b = id[b];

	if (a == b) return;

	if (group[a].size() < group[b].size()) swap(a, b);

	if (a == id[0]) {
		for (int i = 0; i < group[b].size(); ++i)
		{
			if (answer[group[b][i]] == 0) answer[group[b][i]] = query_num;
		}
	}
	else if (b == id[0]) {
		for (int i = 0; i < group[a].size(); ++i)
		{
			if (answer[group[a][i]] == 0) answer[group[a][i]] = query_num;
		}
	}

	for (int i = 0; i < group[b].size(); ++i)
	{
		id[group[b][i]] = a;
		group[a].push_back(group[b][i]);
	}

	group[b].clear();
}

int main()
{
	memset(answer, 0, sizeof answer);

	cin >> N >> M >> Q;

	init(N + 1);

	for (int i = 0; i < M; i++)
	{
		int A, B; cin >> A >> B;
		--A, --B;
		bridges.push_back(pair<int, int>(A, B));
	}

	for (int i = 0; i < Q; i++)
	{
		int C, D; cin >> C >> D;
		--C, --D;
		a[C][D] = a[D][C] = true;
		queries.push_back(pair<int, int>(C, D));
	}

	for (int i = 0; i < M; i++)
	{
		pair<int, int> bridge = bridges[i];

		if (a[bridge.first][bridge.second]) continue;

		merge(bridge.first, bridge.second, -1);
	}

	for (int i = Q - 1; i >= 0; --i)
	{
		pair<int, int> query = queries[i];
		merge(query.first, query.second, i + 1);
	}

	for (int i = 1; i < N; ++i)
	{
		cout << answer[i] << endl;
	}
}