#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include <bits/stdc++.h>
using namespace std;
using i32 = int32_t; using i64 = int64_t; using f64 = double_t; using str = string;
template <typename T> using vec = vector<T>;
template <typename T> using heap = priority_queue<T, vec<T>, greater<T>>;
#define times(n, i) for (i64 i = 0; i < (n); ++i)
#define range(n, m, i) for (i64 i = (n); i < (m); ++i)
#define upto(n, m, i) for (i64 i = (n); i <= (m); ++i)
#define downto(n, m, i) for (i64 i = (n); i >= (m); --i)
#define foreach(xs, x) for (auto &x : (xs))
#define all(xs) (xs).begin(), (xs).end()
#define sortall(xs) sort(all(xs))
#define reverseall(xs) reverse(all(xs))
#define uniqueall(xs) (xs).erase(unique(all(xs)), (xs).end())
#define maximum(xs) (*max_element(all(xs)))
#define minimum(xs) (*min_element(all(xs)))
#define even(x) (((x) & 1) == 0)
#define odd(x) (((x) & 1) == 1)
#define append emplace_back
const i64 MOD = 1000000007;

i32 n, m, q;
i32 ans[200001];

set<pair<i32, i32>> ab;

struct unionfind {
    vec<i32> data;
    vec<vec<i32>> group;
    unionfind(i32 size) : data(size, -1), group(size) { times(size, i) group[i].append(i); }
    void unite(i32 x, i32 y) {
        x = find(x); y = find(y); if (x == y) return;
        if (data[y] < data[x]) swap(x, y); data[x] += data[y]; data[y] = x;
        foreach(group[y], z) group[x].append(z);
    }
    i32 find(i32 x) { return data[x] < 0 ? x : data[x] = find(data[x]); }
    i32 size(i32 x) { return -data[x]; }
    i32 same(i32 x, i32 y) { return find(x) == find(y); }
};

i32 main()
{
    cin >> n >> m >> q;
    vec<pair<i32, i32>> cd(q);

    times(m, i) {
        i32 a, b; cin >> a >> b;
        ab.insert(make_pair(a, b));
    }
    times(q, i) {
        cin >> cd[i].first >> cd[i].second;
        ab.erase(cd[i]);
    }
    reverseall(cd);

    unionfind uf(n+1);
    for (auto it = ab.begin(); it != ab.end(); it++) {
        uf.unite(it->first, it->second);
    }

    upto(1, n, i) {
        if (uf.same(1, i))
            ans[i] = -1;
    }

    downto(q, 1, j) {
        i32 i = q-j, a = cd[i].first, b = cd[i].second;
        if (uf.same(a, b))
            continue;
        if (ans[a] != 0 || ans[b] != 0) {
            i32 t = uf.find(ans[a] == 0 ? a : b);
            foreach(uf.group[t], x) {
                ans[x] = j;
            }
        }
        uf.unite(a, b);
    }

    upto(2, n, i) {
        cout << ans[i] << endl;
    }
    return 0;
}