#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct UnionFind {
    int ngroup, N;
    vector<int> par, siz;

    UnionFind(int _N) : N(_N), par(_N), siz(_N){
        ngroup = _N;
        for(int i = 0; i < N; i++) par[i] = i, siz[i] = 1;
    }

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

    int unite(int x, int y) {
        int rx = root(x), ry = root(y);
        if (rx == ry) return rx;
        ngroup--;
        if (siz[rx] > siz[ry]) swap(rx, ry);
        par[rx] = ry; siz[ry] += siz[rx];
        return ry;
    }

    bool same(int x, int y) {
        int rx = root(x), ry = root(y);
        return rx == ry;
    }

    int size(int x) {return siz[root(x)];}
    int group_count() {return ngroup;}

    vector<vector<int>> groups(){
        vector<int> rev(N); int nrt=0;
        for (int i=0; i<N; i++) if (root(i) == i) rev[i] = nrt, nrt++;
        vector<vector<int>> res(nrt);
        for (int i=0; i<N; i++) res[rev[root(i)]].push_back(i);

        return res;
    }};

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

    int N, M, Q;
    cin >> N >> M >> Q;
    UnionFind tree(N);
    vector<int> a(M), b(M), c(Q), d(Q);
    set<pair<int, int>> st;
 
    for (int i=0; i<M; i++){
        cin >> a[i] >> b[i];
        a[i]--; b[i]--;
    }

    for (int i=0; i<Q; i++){
        cin >> c[i] >> d[i];
        c[i]--; d[i]--;
        st.insert({c[i], d[i]});
    }
    vector<vector<int>> v(N);
    vector<int> ans(N);

    //z回目にx, yをマージ
    auto merge=[&](int x, int y, int z){
        if (tree.same(x, y)) return;
        x = tree.root(x);
        y = tree.root(y);
        if (tree.same(y, 0)) swap(x, y);
        if (tree.same(x, 0)){
            for (auto w : v[y]) ans[w] = z;
        }
        if (v[x].size() > v[y].size()) swap(x, y);
        for (auto w : v[x]) v[y].push_back(x);
        v[x].clear();
        x = tree.unite(x, y);
        if (x != y) swap(v[x], v[y]);
    };

    for (int i=0; i<N; i++) v[i].push_back(i);
    for (int i=0; i<M; i++){
        if (!st.count({a[i], b[i]})){
            merge(a[i], b[i], -1);
        }
    }
    for (int i=Q-1; i>=0; i--){
        merge(c[i], d[i], i+1);
    }

    for (int i=1; i<N; i++) cout << ans[i] << endl;
 
    return 0;
}