#include <set>
#include <map>
#include <list>

#include <stack>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
using namespace std;

/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))


/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
const int inf = 1001001001;
const int mod = 1e6;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};


/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }




/* main */

struct UnionFind {
    vector<int> par; // 親ノード
    vector<int> rank; // ランク

    UnionFind(int n = 1) {
        init(n);
    }

    void init(int n = 1) {
        par.resize(n); rank.resize(n);
        for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0;
    }

    int root(int x) {
        if (par[x] == x) {
            return x;
        }
        else {
            int r = root(par[x]);
            return par[x] = r;
        }
    }

    bool issame(int x, int y) {
        return root(x) == root(y);
    }

    bool merge(int x, int y) {

        x = root(x); y = root(y);
        if (x == y) return false;
        if(x == 0){
            par[y] = x;
            ++rank[x];
            return true;
        }
        if(y == 0){
            par[x] = y;
            ++rank[y];
            return true;
        }
        if (rank[x] < rank[y]) swap(x, y);
        if (rank[x] == rank[y]) ++rank[x];
        par[y] = x;
        return true;
    }

    int count_connected_comp(){
        set<int> s;
        rep(i,0,par.size()){
            s.insert(par[i]);
        }
        return s.size();
    }
};




signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);


    
    int n, m, q; cin >> n >> m >> q;

    vec<pi> edges; 
    rep(i,0,m){
        int f, t; cin >>  f >> t; f--; t--;

        edges.push_back(make_pair(f,t));
    }

    vec<pi> broken_edges;
    reverse(all(broken_edges));

    rep(i,0,q){
        int f,t; cin >> f >> t; f--; t--;
        broken_edges.push_back(make_pair(f, t));
    }
    reverse(all(broken_edges));

    set<pi> s; rep(i,0, broken_edges.size()) s.insert(broken_edges[i]);

    UnionFind uf = UnionFind(n);

    //union_nodes
    rep(i,0,m) if(not exist(s, edges[i])) uf.merge(edges[i].first, edges[i].second);

    vec<vi> roots(n, vi());

    rep(i,1,n){
        roots[uf.root(i)].push_back(i);
    }
    vi ans(n,-10);

    //can visit arbitary
    rep(i,1,n){
        if(uf.root(i) == 0){
            ans[i] = -1;
        }
    }

    vi lst(n);
    rep(i,0,broken_edges.size()){
        int f = broken_edges[i].first, t = broken_edges[i].second;
        if((uf.root(f) == 0 && uf.root(t) != 0) or (uf.root(f) != 0 && uf.root(t) == 0)){
            chmax(lst[uf.root(f)], (int)broken_edges.size() - i);
            chmax(lst[uf.root(t)], (int)broken_edges.size() - i);
        }

        uf.merge(f, t);

    }
    
    //can never visit
    rep(i,1, n){
        if(uf.root(i) != 0){
            ans[i] = 0;
        }
    }

    rep(i,1,n){
        rep(j,0,roots[i].size()){
            ans[roots[i][j]] = lst[i];
        }
    }


    rep(i,1, n){
        print(ans[i]);
    }


    
    

    



    





    
    

















}