#include <iostream>
#include <utility>
#include <vector>
#include <string>
#include <cmath>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
using namespace std;
using ll = long long int;
#define chmax(x,y)  (x) = ((x) > (y)) ? (x) : ((x) = (y));
#define chmin(x,y)  (x) = ((x) < (y)) ? (x) : ((x) = (y));

struct UnionFind
{
  vector<int> parent,rank;
  UnionFind(int n)
  {
    parent = rank = vector<int> (n);
    for(int i=0;i<n;++i)parent[i] = i;
  }  
  int root(int x)
  {
    if(x == parent[x])return x;
    else return parent[x] = root(parent[x]);
  }
  int connect(int x, int y)
  {
    x = root(x);y = root(y);
    if(x == y)return x;
    if(rank[x] < rank[y])swap(x,y);
    parent[y] = x;
    if(rank[x] == rank[y])rank[x]++;
    return x;
  }
};
vector<int> answer (101010,0);
vector<int> X(202020),Y(202020);
vector<int> conec[202020];
int main(int argc, char const *argv[])
{
  int N,M,Q; cin >> N >> M >> Q;
  set<pair<int,int>> st;
  for(int i=0;i<M;++i)
  {
    int x,y; cin >> x >> y;
    st.insert({--x, --y});
  }
  for(int i=0;i<Q;++i)
  {
    cin >> X[i] >> Y[i];
    st.erase({--X[i],--Y[i]});
  }

  UnionFind uf(N+1);
  for(auto &e : st)
  {
    uf.connect(e.first,e.second);
  }
  for(int i=0;i<N;++i)
  {
    conec[uf.root(i)].push_back(i);
  }
  for(int i=0;i<N;++i)
  {
    if(uf.root(i) == 0)
    {
      answer[i] = -1;
    }
  }

  
  for(int i=Q-1;i>=0;--i)
  {
    if(uf.root(X[i]) != uf.root(Y[i]))
    {
      int x = uf.root(X[i]);
      int y = uf.root(Y[i]);
      if(x == uf.root(0))
      {
        for(auto &z : conec[y])
        {
          answer[z] = i+1;
        }
      }
      if(y == uf.root(0))
      {
        for(auto &z : conec[x])
        {
          answer[z] = i+1;
        }
      }
      if(uf.rank[x] < uf.rank[y])swap(x,y);
      uf.connect(x,y);
      for(auto &z : conec[y])conec[x].push_back(z);
      conec[y].clear();
      if(uf.root(x)==y) swap(conec[x],conec[y]);
    }
  }
  for(int i=1;i<N;++i)
  {
    std::cout << answer[i] << std::endl;
  }
}