#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int Z;

template<typename T> class RPQ : public PQ<T, vector<T>, greater<T>> { };
template<typename Cost> void dijkstra_modoki(int start, vector<pair<int, Cost>> g[], Cost dist[]) {
	RPQ<pair<Cost, int>> q;
	dist[start] = Z;
	q.emplace(dist[start], start);
	while(! q.empty()) {
		auto cp = q.top(); q.pop();
		int  p = cp.SE;
		Cost c = cp.FI;
		if(dist[p] != c) { continue; }
		for(auto && e : g[p]) {
			int  ep = e.FI;
			Cost ec = e.SE;
			if(setmin(dist[ep], max(dist[p], ec))) { q.emplace(dist[ep], ep); }
		}
	}
	return;
}

int n, m, q, a[100000], b[100000], c[100000], d[100000];
vector<pair<int, int>> v[100000];
map<int, int> mp[100000];
int dist[100000];

int main() {
	cin >> n >> m >> q;
	Z = -(q + 1);
	inc(i, m) { cin >> a[i] >> b[i]; a[i]--; b[i]--; assert(a[i] < b[i]); }
	inc(i, q) { cin >> c[i] >> d[i]; c[i]--; d[i]--; assert(c[i] < d[i]); }
	
	inc(i, m) { mp[a[i]][b[i]] = Z; }
	inc(i, q) { mp[c[i]][d[i]] = -(i + 1); }
	inc(i, m) {
		v[a[i]].EB(b[i], mp[a[i]][b[i]]);
		v[b[i]].EB(a[i], mp[a[i]][b[i]]);
	}
	
	dijkstra_modoki(0, v, dist);
	
	incID(i, 1, n) {
		if(dist[i] == Z) { dist[i] = -1; } else { dist[i] *= -1; }
		cout << dist[i] << "\n";
	}
	
	return 0;
}