#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int n,m,q;
vector<int> A,B,C,D;
map<int,map<int,bool>> mp;
vector<int> g[100001];

int main(){
    cin>>n>>m>>q;
//    cout << n << " " << m << " " << q << endl;
    rep(i,m){
        int aa,bb;cin>>aa>>bb;
        A.PB(aa-1);
        B.PB(bb-1);
//        cout << aa-1 << " " << bb-1 << endl;
    }
    rep(i,q){
        int cc,dd;cin>>cc>>dd;
        cc--,dd--;
//        cout << cc << " " << dd << endl;
        C.PB(cc);
        D.PB(dd);
        mp[cc][dd]=mp[dd][cc]=true;
    }

    rep(i,m){
        int a=A[i],b=B[i];
        if(mp[a][b]) continue;
        g[a].PB(b);
        g[b].PB(a);
    }


//    for(int i=0;i<n;i++){
//        cout << i << " : " << g[i] << endl;
//    }

    vector<bool> vis(n,false);
    vis[0]=true;

    queue<int> que;
    que.push(0);
    while(!que.empty()){
        int v=que.front();
        que.pop();

        for(int i=0;i<g[v].size();i++){
            int nv=g[v][i];
            if(!vis[nv]){
                vis[nv]=true;
                que.push(nv);
            }
        }
    }

    vector<int> ans(n,INF);
    rep(i,n) if(vis[i]){
        ans[i]=-1;
    }

    //cout << ans << endl;

    for(int i=q-1;i>=0;i--){
        int u=C[i],v=D[i];
        if(!vis[u] and !vis[v]){
            g[u].PB(v);
            g[v].PB(u);
            continue;
        }
        else if(vis[u] and vis[v]){
            continue;
        }
        else{
            if(!vis[u] and vis[v]) swap(u,v);
            queue<int> q;
            q.push(v);
            vis[v]=true;
            while(!q.empty()){
                int vv=q.front();q.pop();
                for(int j=0;j<g[vv].size();j++){
                    int nv=g[vv][j];
                    if(!vis[nv]){
                        vis[nv]=true;
                        q.push(nv);
                    }
                }
            }
            for(int j=0;j<n;j++){
                if(vis[j] and ans[j]==INF){
                    ans[j]=i+1;
                }
            }
        }
    }


    for(int i=1;i<n;i++){
        if(ans[i]==INF) cout << 0 << endl;
        else cout << ans[i] << endl;
    }

}