#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#define Add(x, y) (x + y >= mod) ? (x + y - mod) : (x + y)
#define lowbit(x) x & (-x)
#define pi pair<ll, ll>
#define pii pair<ll, pair<ll, ll>>
#define iip pair<pair<ll, ll>, ll>
#define ppii pair<pair<ll, ll>, pair<ll, ll>>
#define ls(k) k << 1
#define rs(k) k << 1 | 1
#define fi first
#define se second
#define full(l, r, x) for(auto it = l; it != r; ++it) (*it) = x
#define Full(a) memset(a, 0, sizeof(a))
#define open(s1, s2) freopen(s1, "r", stdin), freopen(s2, "w", stdout);
#define For(i, l, r) for(register int i = l; i <= r; ++i)
#define _For(i, l, r) for(register int i = r; i >= l; --i)
using namespace std;
using namespace __gnu_pbds;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const int N = 2e5 + 10; 
inline ll read(){
    ll x = 0, f = 1;
    char c = getchar();
    while(c < '0' || c > '9'){
        if(c == '-')
          f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        x = (x << 1) + (x << 3) + (c ^ 48);
        c = getchar();
    }
    return x * f;
}
inline void write(ll x){
	if(x < 0){
		putchar('-');
		x = -x;
	}
	if(x > 9)
	  write(x / 10);
	putchar(x % 10 + '0');
}
struct Edge{
	int u, v;
}_E[N];
int n, m, q;
int ans[N], du[N], dv[N], fa[N];
bool f[N], vis[N];
map<pair<int, int>, int> id;
vector<int> E[N];
inline void add(int u, int v){
	E[u].push_back(v);
	E[v].push_back(u);
}
inline int Find(int x){
	if(x != fa[x])
	  return fa[x] = Find(fa[x]);
	return fa[x]; 
}
inline void dfs(int u, int s){
	vis[u] = 1;
	ans[u] = s;
	for(auto v : E[u]){
		if(vis[v])
		  continue;
		dfs(v, s);
	}
}
inline void merge(int u, int v, int s){
	u = Find(u), v = Find(v);
	if(u == v)
	  return ;
	int rt = Find(1);
	if(Find(u) == rt)
	  dfs(v, s);
	if(Find(v) == rt)
	  dfs(u, s);
	fa[u] = v;
}
bool End;
int main(){
	n = read(), m = read(), q = read();
	for(int i = 1; i <= n; ++i)
	  fa[i] = i;
	for(int u, v, i = 1; i <= m; ++i){
		u = read(), v = read();
		id[{u, v}] = id[{v, u}] = i;
		_E[i] = {u, v};
	}
	for(int i = 1; i <= q; ++i){
		du[i] = read(), dv[i] = read();
		f[id[{du[i], dv[i]}]] = 1;
	}
	for(int i = 1; i <= m; ++i){
		if(f[i])
		  continue;
		merge(_E[i].u, _E[i].v, -1);
		add(_E[i].u, _E[i].v);
	}
	for(int i = q; i >= 1; --i){
		merge(du[i], dv[i], i);
		add(du[i], dv[i]);
	}
	for(int i = 1; i < n; ++i){
		write(ans[i + 1]);
		putchar('\n');
	}
	cerr << '\n' << abs(&Begin - &End) / 1048576 << "MB";
	return 0;
}