#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

struct UnionFind{/*{{{*/
    vector<int> rank,parent;
    vector<vector<int>> groupe;
    UnionFind(int n) : rank(n) , parent(n) , groupe(n)
    {
        rank.assign(n,0);
        parent.assign(n,0);
        for(int i=0;i<n;i++){
            parent[i]=i;
            rank[i]=0;
            groupe[i].push_back(i);
        }
    }

    int find(int x){
        if(parent[x]==x) return x;
        else return parent[x]=find(parent[x]);
    }

    void unite(int x,int y){
        x=find(x);
        y=find(y);
        if(x==y) return;
        if(rank[x]<rank[y]){
            parent[x]=y;
            groupe[y].insert(groupe[y].end(),groupe[x].begin(),groupe[x].end());
            groupe[x].clear();
        }else{
            parent[y]=x;
            groupe[x].insert(groupe[x].end(),groupe[y].begin(),groupe[y].end());
            groupe[y].clear();
            if(rank[x]==rank[y]) rank[x]++;
        }
    }

    bool same(int x,int y){
        return find(x)==find(y);
    }

    void show(){
        for(int i=0;i<groupe.size();i++){
            cout << i << " : " << groupe[i] << endl;
        }
    }
};/*}}}*/

int N,M,Q;
set<pii> g;
int C[200001],D[200001];

int main(){
    cin>>N>>M>>Q;
    rep(i,M){
        int a,b;cin>>a>>b;
        if(a>b) swap(a,b);
        g.insert(MP(a-1,b-1));
    }
    rep(i,Q){
        cin>>C[i]>>D[i];
        C[i]--,D[i]--;
        if(C[i]>D[i]) swap(C[i],D[i]);
        g.erase(MP(C[i],D[i]));
    }

    UnionFind uf(N);
    for(auto t:g){
        int u=t.first;
        int v=t.second;
        uf.unite(u,v);
    }

    vector<int> ans(N,0);
    for(int i=0;i<N;i++){
        if(uf.same(0,i)) ans[i]=-1;
    }

    for(int i=Q-1;i>=0;i--){
        int u=C[i],v=D[i];
        u=uf.find(u);
        v=uf.find(v);
        if(u>v) swap(u,v);
        if(uf.same(0,v)) swap(u,v);

        if(!uf.same(0,u)){
            uf.unite(u,v);
        }else{
            if(uf.same(0,v)) continue;
            for(int j=0;j<uf.groupe[v].size();j++){
                ans[uf.groupe[v][j]]=i+1;
            }
            uf.unite(u,v);
        }
    }

    for(int i=1;i<N;i++){
        cout << ans[i] << endl;
    }
}