#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int main(){
    const int INF = INT_MAX;
    int N, M, Q, t, x, y, tt;
    vi A, B, C, D, ans, vis;
    vector<map<int,int> > G;
    priority_queue<pii> q;
    
    cin >> N >> M >> Q;
    ans = vi(N);
    vis = vi(N);
    A = B = vi(M);
    C = D = vi(Q);
    G = vector<map<int,int> >(N);

    rep(i, M){
        scanf("%d%d", &A[i], &B[i]);
        --A[i];
        --B[i];
        G[A[i]][B[i]] = INF;
        G[B[i]][A[i]] = INF;
    }

    rep(i, Q){
        scanf("%d%d", &C[i], &D[i]);
        --C[i];
        --D[i];
        G[C[i]][D[i]] = i + 1;
        G[D[i]][C[i]] = i + 1;
    }

    q.push(mp(INF, 0));
    while(sz(q)){
        tie(t, x) = q.top();
        q.pop();
        if(vis[x]++)continue;
        if(t == INF)ans[x] = -1;
        else ans[x] = t;

        each(e, G[x]){
            tie(y, tt) = e;
            if(!vis[y]){
                q.push(mp(min(tt, t), y));
            }
        }
    }

    FOR(i, 1, N)printf("%d\n", ans[i]);
}