#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
class pUF{
    vi data,last;vvp sz;
public:
    pUF(ll n){
        data=vi(n,1);last=vi(n,INF);sz=vvp(n);
        rep(i,n)sz[i].pb(-1,1);
    }
    bool heigou(ll x,ll y,ll t){
        x=root(x,t);y=root(y,t);
        if(x==y)return false;
        if(data[x]>data[y])swap(x,y);
        data[y]+=data[x];data[x]=-y;last[x]=t;sz[y].pb(t,data[y]);
        return true;
    }
    ll root(ll i,ll t){if(t<last[i])return i;return root(-data[i],t);}
    ll getsize(ll i,ll t){i=root(i,t);return sz[i][lb(sz[i],P(t,INF))-1].se;}
    bool same(ll a,ll b,ll t){return root(a,t)==root(b,t);}
};
int main(){
    ll n,m,q;cin>>n>>m>>q;
    pUF uf(n);
    vp v;
    rep(i,m){
        ll a,b;cin>>a>>b;a--;b--;if(a>b)swap(a,b);
        v.pb(a,b);
    }
    sort(all(v));
    vb c(m,true);
    vp qu;
    rep(i,q){
        ll a,b;cin>>a>>b;a--;b--;if(a>b)swap(a,b);
        c[lb(v,P(a,b))]=false;qu.pb(a,b);
    }
    ll cnt=0;
    rep(i,m)if(c[i])uf.heigou(v[i].fi,v[i].se,cnt++);
    for(int i=q-1;i>=0;i--)uf.heigou(qu[i].fi,qu[i].se,cnt++);
    REP(i,1,n){
        if(uf.same(0,i,m-q-1))out(-1);
        else if(!uf.same(0,i,m-1))out(0);
        else{
            ll ok=m-1,ng=m-q-1;
            while(ok-ng>1){
                if(uf.same(0,i,(ok+ng)/2))ok=(ok+ng)/2;
                else ng=(ok+ng)/2;
            }
            out(m-ok);
        }
    }
}