#include <iostream>
#include <iomanip>
#include <random>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <numeric>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <sstream>
#include <bitset>
#include <cassert>
#include <fstream>
#include <queue>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
	#define DEBUG_OUTPUT_ENABLED 1
	#define DBG(X) dout << #X << "=" << (X) << '\n';
	#define SAY(X) dout << (X) << '\n';
#else
	#define DEBUG_OUTPUT_ENABLED 0
	#define DBG(X) 42;
	#define SAY(X) 42;
#endif

#define dout   debug::instance

using namespace std;

template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for(auto el: v) cout << el << " "; return os; }
namespace debug {
	struct DebugStream {
		private:
			bool is_first;
		public:
			DebugStream(bool _is_first): is_first(_is_first) {}
			template<typename T> DebugStream operator<<(const T& value) const {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				cout << value;
				return DebugStream(false);
			};

			template<typename T> DebugStream printArray(T* l, T* r) {
				assert(DEBUG_OUTPUT_ENABLED);
				if(is_first) cout << "[DBG] ";
				while(l != r) {
					cout << (*l);
					++l;
					if(l == r) {
						cout << '\n';
					} else {
						cout << ' ';
					}
				}
				return DebugStream(false);
			}
	};
	DebugStream instance(true);
};

using ll = long long int;
using ull = unsigned long long int;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF  = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for(auto& elem: ret) cin >> elem; return ret; }
const int MAXN = (int)1e5 + 7;
const int MAXD = 11;
pii rez[MAXN * MAXD];
int n, m, q;
vector<int> revG[MAXD * MAXN];
int used[MAXD * MAXN];
pii dp[MAXD * MAXN];
inline void addEdge(int v, int u) {
	revG[u].emplace_back(v);
}
void dfs(int v) {
	used[v] = 1;
	for(auto& u: revG[v]) {
		if(!used[u]) dfs(u);
		dp[v] = max(dp[v], dp[u]);
	}
}
void solve() {
	cin >> n >> m;
	for(int i = 0; i < n; ++i) rez[i] = make_pair(-INT_INF, 0);
	for(int id = 0; id < m; ++id) {
		int v = fetch<int>() - 1;
		int u = fetch<int>() - 1;
		for(int d = MAXD - 1; d > 0; --d) {
			addEdge(MAXD * v + d, MAXD * u + d - 1);
			addEdge(MAXD * u + d, MAXD * v + d - 1);
		}
	}
	for(int v = 0; v < n * MAXD; ++v) dp[v] = make_pair(-INT_INF, 0);
	cin >> q; for(int que = 0; que < q; ++que) {
		int v = fetch<int>() - 1;
		int d = fetch<int>();
		int c = fetch<int>();
		dp[MAXD * v + d] = max(dp[MAXD * v + d], make_pair(que, c));
	}
	for(int v = 0; v < n * MAXD; ++v) if(!used[v]) dfs(v);
	for(int v = 0; v < n * MAXD; ++v) rez[v / MAXD] = max(rez[v / MAXD], dp[v]);
	for(int v = 0; v < n; ++v) cout << rez[v].second << '\n';
}

int main() {
	fast_io();
	solve();

	return 0;
}


Measured memory_bytes: 76732