#include <bits/stdc++.h>
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))
#define mp(a, b) make_pair(a, b)


/* 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 quick_find{

    vector<vector<int> > g2i;
    vector<int> i2g;

    quick_find(int n){
        g2i.resize(n, vector<int>());
        i2g.resize(n);
        rep(i,0,n) {
            g2i[i].push_back(i);
            i2g[i] = i;
        }
    }

    void merge(int a, int b){
        if(root(a) == root(b)) return;

        if(g2i[root(a)].size() < g2i[root(b)].size()) swap(a, b);

        int ra = root(a), rb = root(b);

        for(int e : g2i[rb]) i2g[e] = ra;

        g2i[ra].insert(g2i[ra].end(), g2i[rb].begin(), g2i[rb].end());

        g2i[rb].clear();

    }


    bool issame(int a, int b){
        return i2g[a] == i2g[b];
    }

    int root(int a){
        return i2g[a];
    }


};




signed main(){

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


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

    set<pi> s;
    rep(i,0,m){
        int f, t; cin >> f >> t; f--; t--;
        s.insert(mp(f, t));
    }



    vec<pi> broken;
    rep(i,0,q){

        int f, t; cin >> f >> t; f--; t--;
        broken.push_back(mp(f,t));
        s.erase(mp(f, t));
    }
    reverse(all(broken));

    vi ans(n,0);

    quick_find qf = quick_find(n);



    each(s, itr){
        pi a = *itr;
        qf.merge(a.first, a.second);
    }



    for(auto e : qf.g2i[qf.root(0)]) ans[e] = -1;

    



    rep(i,0,q){
        int a = broken[i].first, b = broken[i].second;

        if(not qf.issame(a, b)){
            
            if((not qf.issame(0, a)) && (not qf.issame(0, b))){
                qf.merge(a, b);
                continue;
            }

            if(qf.issame(0, a)){
                for(auto e : qf.g2i[qf.root(b)]){
                    if(ans[e] == 0) ans[e] = q - i;
                }
            }else{
                for(auto e : qf.g2i[qf.root(a)]){
                    if(ans[e] == 0) ans[e] = q - i;
                }
            }

            qf.merge(a, b);
        }
    }




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


    







    
    

    



    





    
    

















}