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

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

struct UnionFind{
    vector<ll> parent;
    UnionFind(ll sz){
        parent.resize(sz);
        reset();
    }

    void reset(){
        FOR(i, 0, parent.size()){
            parent[i] = i;
        }
    }

    void unite(ll a, ll b){
        if(a>b){
            swap(a, b);
        }
        ll rootA = findRoot(a);
        ll rootB = findRoot(b);
        if(rootA>rootB){
            swap(rootA, rootB);
        }
        if(rootA==rootB){
            return;
        }else{
            // 小さい方を親にする
            parent[rootB] = rootA;
        }
    }

    ll findRoot(ll a){
        if(parent[a]==a){
            return a;
        }else{
            return parent[a] = findRoot(parent[a]);
        }
    }
};

vector<vector<ll> > G;
vector<ll> ans;

// 塗る
void dfs(ll i, ll v){
    ans[i] = v;
    for(ll to : G[i]){
        if(ans[to]==0) dfs(to, v);
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N, M, Q;
    cin >> N >> M >> Q;
    
    G.resize(N);
    ans.resize(N);

    vector<ll> A(M);
    vector<ll> B(M);
    FOR(i, 0, M){
        ll a, b;
        cin >> a >> b;
        a--;
        b--;
        A[i] = a;
        B[i] = b;
    }

    // 壊される辺
    vector<ll> C(Q);
    vector<ll> D(Q);
    map<pair<ll, ll>, ll> mp_break;
    FOR(i, 0, Q){
        ll c, d;
        cin >> c >> d;
        c--;
        d--;
        C[i] = c;
        D[i] = d;
        mp_break[make_pair(c, d)] = 1;
    }

    auto uf = UnionFind(N);

    // 辺をはる
    FOR(i, 0, M){
        ll a = A[i];
        ll b = B[i];
        auto p = make_pair(a, b);
        if(mp_break.count(p)>0){
            // 辺をはらない
        }else{
            uf.unite(a, b);

            G[a].push_back(b);
            G[b].push_back(a);
        }
    }

    // 壊した後もつながっている点
    FOR(i, 0, N){
        if(uf.findRoot(i)==0){
            ans[i] = -1;
        }
    }

    // 破壊を逆順に
    for(int i=Q-1; i>=0; i--){
        ll c = C[i];
        ll d = D[i];
        ll rootC = uf.findRoot(c);
        ll rootD = uf.findRoot(d);
        
        if(rootC==0 && rootD!=0){
            // 今回でつながる
            dfs(rootD, i+1);
        }
        if(rootD==0 && rootC!=0){
            // 今回でつながる
            dfs(rootC, i+1);
        }
        uf.unite(c, d);
        
        G[c].push_back(d);
        G[d].push_back(c);        
    }

    FOR(i, 1, N){
        p(ans[i]);
    }
    
    return 0;
}