#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

struct UnionFind{
    int sz;
    vector<int> par;
    vector<int> rank;

    UnionFind(int n) : sz(n) {
        par.resize(sz);
        rank.assign(sz, 0);
        for(int i = 0; i < sz; ++i){
            par[i] = i;
        }
    }

    int find(int x){
        if(par[x] == x) return x;
        else    return par[x] = find(par[x]);
    }

    bool same(int x, int y){
        return find(x) == find(y);
    }

    bool unite(int x, int y){
        x = find(x), y = find(y);
        if(x == y)  return false;
        if(rank[x] < rank[y])   par[x] = y;
        else{
            par[y] = x;
            if(rank[x] == rank[y])  ++rank[x];
        }
        return true;
    }
};

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

    int N, M, Q;
    cin >> N >> M >> Q;
    vector<int> A(M), B(M), C(Q), D(Q);
    for(int i = 0; i < M; ++i){
        cin >> A[i] >> B[i];
        --A[i], --B[i];
    }
    set<pair<int, int>> destroy;
    for(int i = 0; i < Q; ++i){
        cin >> C[i] >> D[i];
        --C[i], --D[i];
        destroy.emplace(minmax(C[i], D[i]));
    }
    vector<bool> remain(M);
    for(int i = 0; i < M; ++i){
        remain[i] = destroy.find(minmax(A[i], B[i])) == destroy.end();
    }
    vector<int> lb(N, -1), ub(N, Q + 1);
    bool update = true;
    int cnt = 0;
    while(update){
        cnt += 1;
        assert(cnt <= 100);
        update = false;
        UnionFind uf(N);
        for(int i = 0; i < M; ++i){
            if(remain[i])   uf.unite(A[i], B[i]);
        }
        vector<vector<int>> querys(Q + 1);
        for(int i = 1; i < N; ++i){
            if(ub[i] - lb[i] > 1){
                querys[(lb[i] + ub[i]) / 2].emplace_back(i);
            }
        }
        for(int i : querys[Q]){
            if(uf.same(0, i))   lb[i] = Q;
            else    ub[i] = Q;
            update = true;
        }
        for(int q = Q - 1; q >= 0; --q){
            uf.unite(C[q], D[q]);
            for(int i : querys[q]){
                if(uf.same(0, i))   lb[i] = q;
                else    ub[i] = q;
                update = true;
            }
        }
    }
    // cout << "remain\n";
    // for(int i = 0; i < M; ++i){
    //     cout << remain[i] << ' ';
    // }cout << endl;
    // cout << "cnt:" << cnt << endl;
    // for(int i = 1; i < N; ++i){
    //     cout << lb[i] << ' ';
    // }cout << endl;
    for(int i = 1; i < N; ++i){
        cout << (lb[i] == Q ? -1 : lb[i] + 1) << '\n';
    }

    return 0;
}