#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
signed main(){
  int n,m,q;
  cin>>n>>m>>q;
  vector<int> a(m),b(m),c(q),d(q);
  for(int i=0;i<m;i++) cin>>a[i]>>b[i],a[i]--,b[i]--;
  for(int i=0;i<q;i++) cin>>c[i]>>d[i],c[i]--,d[i]--;
  
  vector<int> ans(n,0),p(n);
  vector<vector<int> > G(n);
  for(int i=0;i<n;i++) G[i].emplace_back(i),p[i]=i;

  auto unite=
    [&](int x,int y,int k){
      x=p[x];y=p[y];
      if(x==y) return;
      if(y==0) swap(x,y);
      if(x!=0&&G[x].size()<G[y].size()) swap(x,y);
      
      for(int z:G[y]){
        p[z]=x;
        G[x].emplace_back(z);
        if(x==0) ans[z]=k;
      }
      G[y].clear();
    };
  
  using P = pair<int, int>;
  set<P> sp;
  for(int i=0;i<q;i++) sp.emplace(c[i],d[i]);

  for(int i=0;i<m;i++){
    if(sp.count(P(a[i],b[i]))) continue;
    unite(a[i],b[i],-1);
  }

  reverse(c.begin(),c.end());
  reverse(d.begin(),d.end());
  for(int i=0;i<q;i++) unite(c[i],d[i],q-i);

  for(int i=1;i<n;i++) cout<<ans[i]<<endl;
  return 0;
}