#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=2e9+1;
const ll INF=4e18;
const ll dy[8]={-1,0,1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll calc(ll d){
  return (ll)((-1+sqrt(1+4*d))/2.0);
}
ll excalc(ll d){
  ll ok=0;ll ng=inf;
  while(ng-ok>1){
    ll mid=(ok+ng)/2;
    if(mid*(mid+1)<=d)ok=mid;
    else ng=mid;
  }
  return ok;
}

struct UnionFind {
    vector<int> par;
    vector<int> edge;
    
    UnionFind(int n) : par(n, -1),edge(n, 0) {}

    int root(int x) {
        if (par[x] < 0) return x;
        else return par[x] = root(par[x]);
    }
    
    bool same(int x, int y) {
        return root(x) == root(y);
    }
    
    bool merge(int x, int y) {
        x = root(x); y = root(y);
        if (x == y) {
            edge[x]++;
            return false;
        }
        if (par[x] > par[y]) swap(x, y);
        par[x] += par[y];
        par[y] = x;
        edge[x] += edge[y]+1;
        return true;
    }
    
    int size(int x) {
        return -par[root(x)];
    }
};

int main(){
  ll n,m,q;cin >> n >> m >> q;
  set<pl> st;
  rep(i,m){
    ll x,y;cin >>x >> y;x--;y--;
    st.insert({x,y});
  }
  vpl qs(q);
  rep(i,q){
    ll x,y;cin >> x>> y;x--;y--;
    st.erase({x,y});
    qs[i]={x,y};
  }
  vl ng(n,q+1),ok(n,-1);//時刻tで連結か？
  rep(_,30){
    UnionFind uf(n);
    for(auto q:st)uf.merge(q.first,q.second);
    vvl mid(q+1);
    rep(i,n)mid[(ok[i]+ng[i])/2].emplace_back(i);
    per(i,q+1){
      for(auto x:mid[i]){
        if(uf.same(0,x))ok[x]=i;
        else ng[x]=i;
      }
      if(!i)break;
      uf.merge(qs[i-1].first,qs[i-1].second);
    }
  }
  repl(i,1,n){
    if(ok[i]==q)cout << -1 << endl;
    else cout << ok[i]+1 << endl;
  }
}