/* template.cpp [[[ */
#include <bits/stdc++.h>
using namespace std;
#define get_macro(a, b, c, d, name, ...) name
#define rep(...) get_macro(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(...) get_macro(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define rep1(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, s) for (ll i = (a); i < (ll)(b); i += (ll)s)
#define rrep1(n) rrep2(i_, n)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, a, b) rrep4(i, a, b, 1)
#define rrep4(i, a, b, s) for (ll i = (ll)(b) - 1; i >= (ll)(a); i -= (ll)s)
#define each(x, c) for (auto &&x : c)
#define fs first
#define sc second
#define all(c) begin(c), end(c)
using ui = unsigned;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
const int inf = 1e9 + 10;
const ll inf_ll = 1e18 + 10;
const ll mod = 1e9 + 7;
const ll mod9 = 1e9 + 9;
const int dx[]{-1, 0, 1, 0, -1, 1, 1, -1};
const int dy[]{0, -1, 0, 1, -1, -1, 1, 1};
template<class T, class U> void chmin(T &x, const U &y){ x = min<T>(x, y); }
template<class T, class U> void chmax(T &x, const U &y){ x = max<T>(x, y); }
struct prepare_ { prepare_(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(12); } } prepare__;
ll in(){ ll x; cin >> x; return x; }
vector<ll> in(size_t n){ vector<ll> v(n); each(x, v) cin >> x; return v; }
/* ]]] */

int n, m, q;
int a[200000], b[200000];
int c[200000], d[200000];
vector<int> gs[200000];
int id[200000];
int res[200000];
void unite(int x, int y, int t){
  int ix = id[x], iy = id[y];
  if (ix == iy) return;
  if (gs[ix].size() < gs[iy].size()) swap(x, y), swap(ix, iy);
  if (id[0] == ix) each(v, gs[iy]) res[v] = t;
  if (id[0] == iy) each(v, gs[ix]) res[v] = t;
  each(v, gs[iy]) id[v] = ix;
  gs[ix].insert(gs[ix].end(), all(gs[iy]));
  gs[iy].clear();
  gs[iy].shrink_to_fit();
}

int main(){
  cin >> n >> m >> q;
  rep(i, m) cin >> a[i] >> b[i], a[i]--, b[i]--;
  rep(i, q) cin >> c[i] >> d[i], c[i]--, d[i]--;
  set<pair<int, int>> s;
  rep(i, q) s.emplace(c[i], d[i]);
  rep(i, n) gs[i].push_back(i), id[i] = i;
  rep(i, m) if (!s.count({a[i], b[i]})) unite(a[i], b[i], -1);
  memset(res, -1, sizeof(res));
  rrep(i, m) unite(c[i], d[i], i + 1);
  rep(i, n) if (id[i] != id[0]) res[i] = 0;
  rep(i, n) cout << res[i] << endl;
}