#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
const ll MOD=1e9+7;
struct UF{
  vector<int> data;
  UF(int size):data(size,-1){}
  bool unite(int x,int y){
    x=root(x); y=root(y);
    if(x!=y){
      if(data[y]<data[x]) swap(x,y);
      data[x]+=data[y]; data[y]=x;
    }
    return x!=y;
  }
  bool findSet(int x,int y){return root(x)==root(y);}
  int root(int x){return data[x]<0?x:data[x]=root(data[x]);}
  int size(int x) {return -data[root(x)];}
};

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
  int n,m,q;
  cin>>n>>m>>q;
  UF uf(n);
  map<pii,int> a;
  rep(i,m){
    int x,y;
    cin>>x>>y; --x; --y;
    a[pii(x,y)]=MOD;
  }
  rep(i,q){
    int x,y;
    cin>>x>>y; --x; --y;
    a[pii(x,y)]=i+1;
  }
  vector<pair<int,pii>> b;
  for(auto p:a){
    b.eb(p.Y,p.X);
  }
  sort(rall(b));
  vector<int> id(n);
  unordered_set<int> sts[n];
  rep(i,n){
    sts[i]={i};
    id[i]=i;
  }
  vector<int> re(n);
  for(auto pp:b){
    int x,y;
    tie(x,y)=pp.Y;
    x=id[x]; y=id[y];
    if(x==y) continue;
    if(sts[x].size()>sts[y].size()) swap(x,y);
    if(id[0]==x) swap(x,y);
    for(int a:sts[x]){
      if(!(id[a]=y)) MX(re[a],pp.X);
      sts[y].insert(a);
    }
    sts[x].clear();
    //cout<<pp<<id;
  }
  rep(i,n)if(i) cout<<(re[i]==MOD?-1:re[i])<<endl;
  return 0;
}