#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;

struct UnionFind {
    vector<int> data;
    int sz;
    vector<vector<int>> mem;
    UnionFind(int sz) : data(sz, -1), sz(sz), mem(sz) {
        for (int i = 0; i < sz; i++) init(i);
    }
    bool unionSet(int x, int y) {
        if ((x = root(x)) == (y = root(y))) return false;
        if (data[x] > data[y]) swap(x, y);
        data[x] += data[y]; data[y] = x; sz--;
        mem[x].insert(mem[x].end(), mem[y].begin(), mem[y].end());
        mem[y].clear();
        return true;
    }
    bool findSet(int x, int y) { return root(x) == root(y); }
    vector<int>& operator[](int x) { return mem[root(x)]; }
    void init(int x) { int r = root(x); mem[r] = {r}; }
    int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
    int size(int x) { return -data[root(x)]; }
    int size() { return sz; }
};

int main() {
    int n, m, q; cin >> n >> m >> q;
    set<pair<int, int>> edges;
    for (int i = 0; i < m; i++) {
        int a, b; cin >> a >> b; a--, b--;
        edges.emplace(a, b);
    }
    vector<pair<int, int>> cd;
    for (int i = 0; i < q; i++) {
        int c, d; cin >> c >> d; c--, d--;
        cd.emplace_back(c, d);
        edges.erase({c, d});
    }
    UnionFind uf(n);
    for (auto &p: edges) uf.unionSet(p.first, p.second);
    vector<int> res(n, -1);
    for (int x: uf[0]) res[x] = -1;
    uf[0].clear();
    for (int i = q - 1; i >= 0; i--) {
        int c = cd[i].first, d = cd[i].second;
        uf.unionSet(c, d);
        for (int x: uf[0]) res[x] = i + 1;
        uf[0].clear();
    }
    for (int i = 1; i < n; i++) cout << res[i] << endl;
    return 0;
}