#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/

int N,M,Q;

vector<int> G(123450, INT_MAX);
set<int> E[123450];
int C[223450][2];
auto que = queue<int>();

void update(int n) {
    while(!que.empty()) {
        int i = que.front();
        que.pop();
        for (auto e:E[i]) {
            if (G[e] == INT_MAX) {
                G[e] = n;
                que.push(e);
            }
        }
    }
}

void solve() {
    cin>>N>>M>>Q;
    int a,b;
    REP(i,M) {
        cin>>a>>b;
        a--;
        b--;
        E[a].insert(b);
        E[b].insert(a);
    }
    REP(i,Q) {
        cin>>a>>b;
        a--;
        b--;
        E[a].erase(b);
        E[b].erase(a);
        C[i][0]=a;
        C[i][1]=b;
    }
    G[0] = -1;
    que.push(0);
    update(-1);
    RREP(i,Q) {
        int a = C[i][0], b = C[i][1];
        E[a].insert(b);
        E[b].insert(a);
        if (G[a]<INT_MAX)que.push(a);
        if (G[b]<INT_MAX)que.push(b);
        update(i+1);
    }
    FOR(i,1,N) {
        out("%lld\n", (G[i]==INT_MAX)?0:G[i]);
    }
}