#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;


int main(int argc, char const *argv[])
{
  const int INF = 1e9;
  int N,M,Q;cin >> N >> M >> Q;
  map<int,int> E[N];
  for(int i=0;i<M;++i)
  {
    int a,b;
    cin >> a >> b;
    E[--a][--b] = INF;
    E[b][a] = INF;
  }

  for(int i=0;i<Q;++i)
  {
    int c,d; cin >> c >> d;
    E[--c][--d] = i+1;
    E[d][c] = i+1;
  }
  priority_queue<pair<int,int>> que;
  vector<int> ans(N+1,0);
  ans[0] = INF;
  vector<int> done(N+1,0);
  que.push({INF,0});

  while (que.size())
  {
    auto q = que.top();que.pop();

    int c = q.first;
    int i = q.second;

    if(done[i])continue;
    done[i] = true;

    for(auto p : E[i])
    {
      int j = p.first;
      int n = p.second;
      if(ans[j] < min(ans[i],n))
      {
        ans[j] = min(ans[i],n);
        que.push({ans[j],j});
      }
    }
  }
  

  for(int i=1;i<N;++i)
  {
    if(ans[i] == INF)std::cout << -1 << std::endl;
    else std::cout << ans[i] << std::endl;
  }
}