/* -*- coding: utf-8 -*-
 *
 * 416.cc: No.416 旅行会社 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100000;
const int MAX_M = 100000;

const int INF = 1 << 30;

/* typedef */

typedef pair<int,int> pii;
typedef map<pii,int> mpii;
typedef vector<pii> vpii;

/* global variables */

mpii es;
vpii nbrs[MAX_N];
int dists[MAX_N];

/* subroutines */

/* main */

int main() {
  int n, m, qn;
  scanf("%d%d%d", &n, &m, &qn);

  for (int i = 0; i < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    es[pii(u, v)] = -1;
  }

  for (int i = 0; i < qn; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--, v--;
    es[pii(u, v)] = qn - i;
  }

  for (mpii::iterator mit = es.begin(); mit != es.end(); mit++) {
    const int &u = mit->first.first, &v = mit->first.second, &c = mit->second;
    nbrs[u].push_back(pii(v, c));
    nbrs[v].push_back(pii(u, c));
  }

  for (int i = 0; i < n; i++) dists[i] = INF;
  dists[0] = -1;

  priority_queue<pii> q;
  q.push(pii(1, 0));

  while (! q.empty()) {
    pii u = q.top(); q.pop();
    int ud = -u.first, &ui = u.second;
    vpii &nbru = nbrs[ui];
    for (vpii::iterator vit = nbru.begin(); vit != nbru.end(); vit++) {
      int &vi = vit->first, vd = max(ud, vit->second);
      if (dists[vi] > vd) {
	dists[vi] = vd;
	q.push(pii(-vd, vi));
      }
    }
  }

  for (int i = 1; i < n; i++) {
    if (dists[i] >= INF) puts("0");
    else if (dists[i] < 0) puts("-1");
    else printf("%d\n", qn - dists[i] + 1);
  }
  return 0;
}