#include<bits/stdc++.h>
using namespace std;
const int N=1000005;
int n,m,q,u[N],v[N],fa[N],ans[N];
set<pair<int,int> >s;
vector<int>son[N];
int find(int u){return fa[u]==u?u:find(fa[u]);}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m>>q;
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1,u,v;i<=m;i++)
	{
		cin>>u>>v;
		s.insert(make_pair(u,v));
	}
	for(int i=1;i<=q;i++)
	{
		cin>>u[i]>>v[i];
		s.erase(make_pair(u[i],v[i]));
	}
	for(pair<int,int> e:s)fa[e.first]=e.second;
	for(int i=1;i<=n;i++)son[find(i)].push_back(i);
	for(int i=1;i<=n;i++)if(find(i)!=i)son[i].push_back(i); 
	for(int i=2;i<=n;i++)if(find(1)==find(i))ans[i]=-1;
	for(int i=q,fx,fy;i;i--)
	{
		fx=find(u[i]);fy=find(v[i]);
		if(fx==find(1))for(int u:son[fy])if(!ans[u])ans[u]=i;
		if(fy==find(1))for(int u:son[fx])if(!ans[u])ans[u]=i;
		if(fx==fy)continue;
		if(son[fx].size()<son[fy].size())swap(fx,fy);
		for(int u:son[fy])son[fx].push_back(u);
		son[fy].clear();son[fy].push_back(fy);fa[fy]=fx;
	}
	for(int i=2;i<=n;i++)cout<<ans[i]<<'\n';
}