#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}

const int MAX_N = 200100;
int par[MAX_N]; // 親
int rank_[MAX_N]; // 木の深さ
int cnt_[MAX_N]; // 属する頂点の個数(親のみ正しい)

// n要素で初期化
void UFinit(){
    for(int i=0;i<MAX_N;i++){
        par[i] = i;
        rank_[i] = 0;
        cnt_[i] = 1;
    }
}

// 木の根を求める
int find(int x){
    if(par[x] == x){
        return x;
    }else{
        return par[x] = find(par[x]);
    }
}

// xとyの属する集合を併合
void unite(int x, int y){
    x = find(x);
    y = find(y);
    if(x == y) return;

    if(rank_[x] < rank_[y]){
        par[x] = y;
        cnt_[y] += cnt_[x];
    }else{
        par[y] = x;
        cnt_[x] += cnt_[y];
        if(rank_[x] == rank_[y]) rank_[x]++;
    }
}

// xとyが同じ集合に属するか否か
bool same(int x, int y){
    return find(x) == find(y);
}


int main() {
    UFinit();
    int n, m, q;
    cin >> n >> m >> q;
    int a[m], b[m], c[q], d[q];
    rep(i,m){
        cin >> a[i] >> b[i];
        a[i]--; b[i]--;
    }
    rep(i,q){
        cin >> c[i] >> d[i];
        c[i]--; d[i]--;
    }
    map<P,int> mp;
    rep(i,m)mp[P(a[i],b[i])] = q + 1;
    rep(i,q)mp[P(c[i],d[i])] = i + 1;
    vector<P> G[q+2];
    for(auto x : mp) G[x.second].push_back(x.first);
    int l[n] = {}, r[n];
    rep(i,n){
        r[i] = q+1;
    }
    rep(_,30){
        vector<P> v;
        rep(i,n){
            if(l[i]==r[i])continue;
            int mid = (l[i]+r[i]) / 2 + 1;
            v.push_back(P(mid,i));
        }
        if(v.size()==0)break;
        sort(v.begin(), v.end(), greater<P>());
        UFinit();
        int ite = 0;
        drep(i,q+2){
            rep(j,G[i].size()){
                unite(G[i][j].first, G[i][j].second);
            }
            while(ite<v.size() && v[ite].first == i){
                if(same(v[ite].second, 0)){
                    l[v[ite].second] = i;
                }else{
                    r[v[ite].second] = i-1;
                }
                ite++;
            }
        }
    }
    srep(i,1,n){
        if(l[i]==0){
            cout << 0 << endl;
        }else if(l[i]==q+1){
            cout << -1 << endl;
        }else{
            cout << l[i] << endl;
        }
    }
    return 0;
}