/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.02 01:25:55
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

// UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }
    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }
    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }
    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }
    int size(int x) {
        return -par[root(x)];
    }
};
vector<vector<int>> g;
vector<int> ans;
void dfs(int v, int c) {
    ans[v] = c;
    for(int u : g[v]) {
        if (ans[u] != 0) continue;
        dfs(u,c);
    }
}
int main() {
    int n,m,q;cin >> n >> m >> q;
    set<pair<int,int>> st;
    for (int i = 0; i < m; i++) {
        int u,v;cin >> u >> v;
        u--;v--;
        if (u > v) swap(u,v);
        st.insert({u,v});
    }
    vector<pair<int,int>> query(q);
    g.resize(n);
    for(int i = 0; i < q; i++) {
        int u,v;cin >> u >> v;
        u--;v--;
        if (u > v) swap(u,v);
        query[i] = {u,v};
        st.erase({u,v});
    }
    ans.resize(n,0);
    UnionFind uf(n);
    for(auto p : st) {
        uf.unite(p.first,p.second);
        g[p.first].push_back(p.second);
        g[p.second].push_back(p.first);
    }
    dfs(0,-1);
    for(int i = q - 1; i >= 0; i--) {
        if (uf.same(query[i].first,0) && !uf.same(query[i].second,0)) {
            uf.unite(query[i].first,query[i].second);
            g[query[i].first].push_back(query[i].second);
            g[query[i].second].push_back(query[i].first);
            dfs(query[i].second,i + 1);
        }
        else if (!uf.same(query[i].first,0) && uf.same(query[i].second,0)) {
            uf.unite(query[i].first,query[i].second);
            g[query[i].first].push_back(query[i].second);
            g[query[i].second].push_back(query[i].first);
            dfs(query[i].first,i + 1);
        }
        else {
            uf.unite(query[i].first,query[i].second);
            g[query[i].first].push_back(query[i].second);
            g[query[i].second].push_back(query[i].first);
        }
    }
    for (int i = 0; i < n-1; i++) {
        cout << ans[i + 1] << endl;
    }
    return 0;
}