// Slower C++ solution:
#include<iostream>

#include<iomanip>

#include<algorithm>

#include<cstring>

#include<string>

#include<cmath>

#include<vector>

#include<queue>

#include<stack>

#include<map>

#include<set>

using namespace std;

const int inf=2147483647,dx[]={-1,0,1,0},dy[]={0,-1,0,1};

const long long llinf=9223372036854775807ll;

const int N=100005;

int a[N][3],ma[N],ans[N],bfs[N];

vector<int> g[N];

void go(int in[])

{

	int x=in[0]-1,dd=in[1],v=in[2];

	if(dd<ma[x])

		return ;

	ma[x]=dd;

	bfs[0]=x;

	int rr=1;

	for(int i=0;i<rr;i++)

	{

		int x=bfs[i];

		if(!ans[x])

			ans[x]=v;

		if(!ma[x])

			continue;

		for(int i=0;i<g[x].size();i++)

		{

			int y=g[x][i];

			int nd=ma[x]-1;

			if(nd>ma[y])

			{

				ma[y]=nd;

				bfs[rr++]=y;

			}

		}

	}

}

int n,m,q,x,y;

int main(){

	cin>>n>>m;

	for(int i=0;i<m;i++)

	{

		cin>>x>>y;

		x--,y--;

		g[x].push_back(y);

		g[y].push_back(x);  

	}

	cin>>q;

	for(int i=0;i<q;i++)

		for(int j=0;j<3;j++)

			cin>>a[i][j];

	for(int i=0;i<N;i++)

		ma[i]=-1;

	for(int i=q;i>=0;i--)

		go(a[i]);

	for(int i=0;i<n;i++)

		cout<<ans[i]<<'\n';

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.103038274805134x):
#include "bits/stdc++.h"

using namespace std;

#ifndef LOCAL

#define endl '\n'

#endif



#define fr(i, a, b) for(int i = a; i <= b; i++)

#define rf(i, a, b) for(int i = a; i >= b; i--)

#define pf push_front

#define pb push_back

#define eb emplace_back

#define fi first

#define se second

#define all(x) x.begin(), x.end()

#define rall(x) x.rbegin(), x.rend()

#define sz(x) (int)x.size()

#define lb lower_bound

#define ub upper_bound



typedef long long ll;

typedef long double f80;

typedef pair<int,int> pii;

typedef pair<ll,ll> pll;



int pct(int x) { return __builtin_popcount(x); }

int pct(ll x) { return __builtin_popcountll(x); }

int bt(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

int bt(ll x) { return 63 - __builtin_clzll(x); } // floor(log2(x))

int cdiv(int a, int b) { return a / b + !(a < 0 || a % b == 0); }

ll cdiv(ll a, ll b) { return a / b + !(a < 0 || a % b == 0); }

int nxt_C(int x) { int c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }

ll nxt_C(ll x) { ll c = x & -x, r = x + c; return (((r ^ x) >> 2) / c) | r; }



vector<int> get_bits(int mask) {

	vector<int> bb;

	while(mask) { int b = bt(mask); bb.pb(b); mask ^= (1 << b); }

	reverse(all(bb));

	return bb;

}



int get_mask(vector<int> v) {

	int mask = 0;

	for(int x : v) { mask ^= (1 << x); }

	return mask;

}



template<typename T>

void uniq(vector<T> &v) { sort(all(v)); v.resize(unique(all(v)) - v.begin()); }



mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());



ll rand(ll l, ll r){

	uniform_int_distribution<ll> uid(l, r);

	return uid(rng);

}



void sc() {}



template <typename Head, typename... Tail>

void sc(Head &H, Tail &... T) { cin >> H; sc(T...); }



#ifdef LOCAL

#define debug(...) cerr << "[L:" << __LINE__ << "][" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

#else

#define debug(...) 42

#endif



// #ifndef LOCAL

// string to_string(__int128 x) {

// 	string s = "";

// 	bool neg = 0;

// 	if(x < 0) { s += "-"; neg = 1; x = -x; }

// 	if(!x) s += '0';

// 	while(x) {

// 		int rem = x % 10;

// 		s += to_string(rem);

// 		x /= 10;

// 	}

// 	reverse(s.begin() + neg, s.end());

// 	return s;

// }

// #endif



const int mod = 1e9 + 7; // 998244353;



int pwr(int a,ll b) {

	int ans = 1;

	while(b) {

		if(b & 1) ans = (ans * 1LL * a) % mod;

		a = (a * 1LL * a) % mod;

		b >>= 1;

	}

	return ans;

}



/*

	Lookout for overflows!!

	Check array sizes!!

	Clear before test cases!!

	Use the correct modulo!!

	Check for corner cases!!

	Are you forgetting something?!

	Read problem statement carefully!!!

*/



const int N = 1e5 + 5;

int U[N], D[N], C[N];

vector<int> g[N];

bool vis[N][11];

int color[N];



void solve() {

	int n, m;

    sc(n, m);

    fr(i, 1, m) {

        int u, v;

        sc(u, v);

        g[u].pb(v);

        g[v].pb(u);

    }

    int q;

    sc(q);

    fr(i, 1, q) {

        sc(U[i], D[i], C[i]);

    }

    for(int i = q; i >= 1; i--) {

        if(vis[U[i]][D[i]]) continue;

        vis[U[i]][D[i]] = 1;

        queue<pii> q;

        q.push({U[i], D[i]});

        while(!q.empty()) {

            pii u = q.front();

            q.pop();

            if(!color[u.fi]) color[u.fi] = C[i];

            if(u.se == 0) continue;

            for(int v : g[u.fi]) {

                if(!vis[v][u.se - 1]) {

                    vis[v][u.se - 1] = 1;

                    q.push({v, u.se - 1});

                }

            }

        }

    }

    fr(i, 1, n) {

        cout << color[i] << endl;

    }

}



int main() {

	ios :: sync_with_stdio(0);

	cin.tie(0);

	cout.tie(0);

	int t = 1;

	// cin >> t;

	for(int tt = 1; tt <= t; tt++) {

		solve();

	}

	return 0;

}