// Slower C++ solution:
/*************************************************

 *************************************************

 *************************************************

 *** _________________  |            |  |     /***

 ***         |          |            |  |    / ***

 ***         |          |            |  |   /  ***

 ***         |          |            |  |  /   ***

 ***         |          |            |  | /    ***

 ***         |          |____________|  |/  en ***

 ***         |          |            |  |\     ***

 ***         |          |            |  | \    ***

 *** _____   |          |            |  |  \   ***

 ***   |     |          |            |  |   \  ***

 ***   \     /          |            |  |    \ ***

 ***    \___/           |            |  |     \***

 *************************************************

 *************Written by: JiangHaoKai*************

 *************************************************/

#pragma GCC optimize(2)

#pragma G++ optimize(2)



//#include <bits/stdc++.h>

#include <cassert>

#include <cctype>

#include <cerrno>

#include <cfloat>

#include <climits>

#include <clocale>

#include <cmath>

#include <csetjmp>

#include <csignal>

#include <cstdarg>

#include <cstddef>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <ccomplex>

#include <cfenv>

#include <cinttypes>

#include <cstdalign>

#include <cstdbool>

#include <cstdint>

#include <ctgmath>

#include <cwchar>

#include <cwctype>

#include <algorithm>

#include <bitset>

#include <complex>

#include <deque>

#include <fstream>

#include <functional>

#include <iomanip>

#include <iostream>

#include <limits>

#include <list>

#include <locale>

#include <map>

#include <memory>

#include <numeric>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <stdexcept>

#include <string>

#include <typeinfo>

#include <valarray>

#include <vector>

#include <array>

#include <atomic>

#include <chrono>

#include <condition_variable>

#include <forward_list>

#include <future>

#include <mutex>

#include <random>

#include <ratio>

#include <regex>

#include <scoped_allocator>

#include <system_error>

#include <thread>

#include <tuple>

#include <typeindex>

#include <unordered_map>

#include <unordered_set>

//#include <conio.h>

//#include <windows.h>

using namespace std;



typedef long long LL;

typedef unsigned int ui;

typedef unsigned long long ull;

typedef float fl;

typedef double ld;

typedef pair<int,int> pii;

#define ui(n) ((unsigned int)(n))

#define ll(n) ((long long)(n))

#define ull(n) ((unsigned long long)(n))

#define fl(n) ((float)(n))

#define ld(n) ((double)(n))

#define char(n) ((char)(n))

#define Bool(n) ((bool)(n))

#define fixpoint(n) fixed<<setprecision(n)

const int INF=1061109567;

const LL LINF=4557430888798830399;

#define PI 3.1415926535897932384626433832795028841971

#define MP make_pair

#define MT make_tuple

#define All(a) (a).begin(),(a).end()

#define pall(a) (a).rbegin(),(a).rend()

#define mod 1000000007

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

#define rep(i,n) for(int i=0;i<n;i++)

#define rep1(i,n) for(int i=1;i<=n;i++)

#define repa(i,a,n) for(int i=a;i<n;i++)

#define repa1(i,a,n) for(int i=a;i<=n;i++)

#define repd(i,n) for(int i=n-1;i>=0;i--)

#define repd1(i,n) for(int i=n;i>=1;i--)

#define repda(i,n,a) for(int i=n;i>a;i--)

#define repda1(i,n,a) for(int i=n;i>=a;i--)

#define FOR(i,a,n,step) for(int i=a;i<n;i+=step)

#define repv(itr,v) for(__typeof((v).begin()) itr=(v).begin();itr!=(v).end();itr++)

#define repV(i,v) for(auto i:v)

#define repE(i,v) for(auto &i:v)

#define MS(x,y) memset(x,y,sizeof(x))

#define MC(x) MS(x,0)

#define MCP(x,y) memcpy(x,y,sizeof(y))

#define sqr(x) ((x)*(x))

#define filein(x) freopen(x,"r",stdin)

#define fileout(x) freopen(x,"w",stdout)

#define fileout2(filename,name) ofstream name(filename,ios::out)

#define filein2(filename,name) ifstream name(filename,ios::in)

#define file(filename,name) fstream name(filename,ios::in|ios::out)

#define Pause system("pause")

#define Cls system("cls")

#define fs first

#define sc second

#define PC(x) putchar(x)

#define GC(x) x=getchar()

#define Endl PC('\n')

#define SF scanf

#define PF printf



inline int Read()

{

    int X=0,w=0;char ch=0;while(!isdigit(ch)){w|=ch=='-';ch=getchar();}while(isdigit(ch))X=(X<<3)+(X<<1)+(ch^48),ch=getchar();

	return w?-X:X;

}

inline void Write(int x){if(x<0)putchar('-'),x=-x;if(x>9)Write(x/10);putchar(x%10+'0');}



inline LL powmod(LL a,LL b){LL res=1;a%=mod;assert(b>=0);for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}

inline LL gcdll(LL a,LL b){return b?gcdll(b,a%b):a;}

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

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

/**************************************************************Begin***************************************************************/

const int maxn=100010;



int n,m,q,bx[maxn],dist[maxn],color[maxn],vis[maxn],ans[maxn];

vector<int> e[maxn];



inline void dfs(int x,int col)

{

	repV(i,e[x]) if(vis[x]&&vis[i]<vis[x]-1)

	{

		if(!ans[i]) ans[i]=col;

		vis[i]=vis[x]-1;

		dfs(i,col);

	}

}



int main()

{

	SF("%d%d",&n,&m);

	rep(i,m)

	{

		int a,b;SF("%d%d",&a,&b);

		e[a].push_back(b);

		e[b].push_back(a);

	}

	

	SF("%d",&q);

	rep(i,q) SF("%d%d%d",&bx[i],&dist[i],&color[i]);

	

	MS(vis,-1);

	repd(i,q)

	{

		vis[bx[i]]=dist[i];

		if(!ans[bx[i]]) ans[bx[i]]=color[i];

		dfs(bx[i],color[i]);

	}

	

	rep1(i,n) PF("%d\n",ans[i]);



	return 0;

}

/***************************************************************End****************************************************************/


// Faster C++ solution for the same problem (measured speedup: 4.477581262890772x):
#include<iostream>

#include<cstdio>



const int SIZE = 100000 + 7;



using namespace std;



struct query{

	int d, v, c;

}que[SIZE];



int f[SIZE][14];

int head[SIZE], ver[SIZE * 2], nxt[SIZE * 2];

int N, M, Q, tot = 1;



inline void add(const int &u, const int &v) {

	ver[++tot] = v;

	nxt[tot] = head[u];

	head[u] = tot;

}



inline void BFS(const int &s, const int &d, const int &c) {

	f[s][d] = c;

	if( !d ) return;

	

	if(!f[s][d - 1]) BFS(s, d - 1, c);

	for(int i = head[s]; i; i = nxt[i]) {

		int v = ver[i];

		if(!f[v][d - 1]) BFS(v, d - 1, c);

	}

}



int main() {

	scanf("%d%d",&N,&M);

	for(int i = 1; i <= M; ++i) {

		int a, b; scanf("%d%d",&a,&b);

		add(a, b); add(b, a);

	}

	scanf("%d",&Q);

	for(int i = Q; i >= 1; --i)

		scanf("%d%d%d",&que[i].v,&que[i].d,&que[i].c);

	for(int i = 1; i <= Q; ++i)

		if(!f[que[i].v][que[i].d]) BFS(que[i].v, que[i].d, que[i].c);

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

		printf("%d\n",f[i][0]);

	return 0;

}