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

const int N = 1e5;
int par[N];
list<int> items[N];

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

void unite(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (items[x].size() < items[y].size()) swap(x, y);
    items[x].splice(items[x].end(), items[y]);
    par[y] = x;
}

int main() {
    int n, m, q;
    cin >> n >> m >> q;

    for (int i = 0; i < n; i++) {
        par[i] = i;
        items[i].push_back(i);
    }

    vector<pair<int, int>> g;
    set<pair<int, int>> removed;

    for (int i = 0; i < m; i++) {
        int a, b;
        scanf("%d %d", &a, &b);
        a--; b--;
        g.push_back(minmax(a, b));
    }

    vector<int> c(q), d(q);
    for (int i = 0; i < q; i++) {
        scanf("%d %d", &c[i], &d[i]);
        c[i]--; d[i]--;
        removed.insert(minmax(c[i], d[i]));
    }

    for (auto e : g) if (!removed.count(e)) unite(e.first, e.second);

    vector<int> ans(n);
    for (int i = 0; i < n; i++) ans[i] = find(0) == find(i) ? -1 : 0;

    for (int i = q - 1; i >= 0; i--) {
        c[i] = find(c[i]);
        d[i] = find(d[i]);
        if (c[i] == d[i]) continue;
        if (d[i] == find(0)) swap(c[i], d[i]);
        if (c[i] == find(0)) {
            for (int e : items[d[i]]) ans[e] = i + 1;
        }
        unite(c[i], d[i]);
    }

    for (int i = 1; i < n; i++) {
        printf("%d\n", ans[i]);
    }
}