#include<bits/stdc++.h>
using namespace std;
typedef pair< int, int > Pi;
 
int data[200000];
vector< int > zig[200000];
int query[200000];
 
int find(int y)
{
  if(data[y] < 0) return(y);
  return(data[y] = find(data[y]));
}
void unite(int x, int y)
{
  x = find(x);
  y = find(y);
  if(x != y) {
    if(zig[x].size() < zig[y].size()) swap(x, y);
    data[x] += data[y];
    data[y] = x;
    while(!zig[y].empty()) {
      zig[x].push_back(zig[y].back());
      zig[y].pop_back();
    }
  }
}
 
 
int N, M, Q;
bool v[200000];
int A[200000], B[200000];
int C[200000], D[200000];
 
map< Pi, int > idx;
 
int main()
{
  memset(data, -1, sizeof(data));
  scanf("%d %d %d", &N, &M, &Q);
  for(int i = 0; i < N; i++) zig[i].push_back(i);
   
  for(int i = 0; i < M; i++) {
    scanf("%d %d", &A[i], &B[i]);
    idx[minmax(--A[i], --B[i])] = i;
  }
  for(int i = 0; i < Q; i++) {
    scanf("%d %d", &C[i], &D[i]);
    v[idx[minmax(--C[i], --D[i])]] = true;
  }
  for(int i = 0; i < M; i++) {
    if(!v[i]) unite(A[i], B[i]);
  }
   
  while(!zig[find(0)].empty()) {
    query[zig[find(0)].back()] = -1;
    zig[find(0)].pop_back();
  }
   
  for(int i = Q - 1; i >= 0; i--) {
    unite(C[i], D[i]);
    if(find(C[i]) == find(0)) {
      while(!zig[find(0)].empty()) {
        query[zig[find(0)].back()] = i + 1;
        zig[find(0)].pop_back();
      }
    }
  }
  for(int i = 1; i < N; i++) {
    printf("%d\n", query[i]);
  }
}