Problem:
Score : 700 points

Problem Statement

Squid loves painting vertices in graphs.

There is a simple undirected graph consisting of N vertices numbered 1 through N, and M edges.
Initially, all the vertices are painted in color 0. The i-th edge bidirectionally connects two vertices a_i and b_i. The length of every edge is 1.

Squid performed Q operations on this graph. In the i-th operation, he repaints all the vertices within a distance of d_i from vertex v_i, in color c_i.

Find the color of each vertex after the Q operations.

Constraints

1 ≤ N,M,Q ≤ 10^5

1 ≤ a_i,b_i,v_i ≤ N

a_i ≠ b_i

0 ≤ d_i ≤ 10

1 ≤ c_i ≤10^5

d_i and c_i are all integers.

There are no self-loops or multiple edges in the given graph.

Partial Score

200 points will be awarded for passing the testset satisfying 1 ≤ N,M,Q ≤ 2{,}000.

Input

Input is given from Standard Input in the following format:

N M
a_1 b_1
:
a_{M} b_{M}
Q
v_1 d_1 c_1
:
v_{Q} d_{Q} c_{Q}

Output

Print the answer in N lines.
In the i-th line, print the color of vertex i after the Q operations.

Sample Input 1

7 7
1 2
1 3
1 4
4 5
5 6
5 7
2 3
2
6 1 1
1 2 2

Sample Output 1

2
2
2
2
2
1
0

Initially, each vertex is painted in color 0.
In the first operation, vertices 5 and 6 are repainted in color 1.
In the second operation, vertices 1, 2, 3, 4 and 5 are repainted in color 2.

Sample Input 2

14 10
1 4
5 7
7 11
4 10
14 7
14 3
6 14
8 11
5 13
8 3
8
8 6 2
9 7 85
6 9 3
6 7 5
10 3 1
12 9 4
9 6 6
8 2 3

Sample Output 2

1
0
3
1
5
5
3
3
6
1
3
4
5
3

The given graph may not be connected.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

//-----------------------------------------------------------
// すぐ使える
//-----------------------------------------------------------
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.List;
import java.util.ArrayList;
import java.util.Arrays;

public class Main {
    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        
		// 1行、2つ(複数)数字
		String[] ss0 = br.readLine().trim().split(" ", 0);
		int N = Integer.parseInt(ss0[0]);
		int M = Integer.parseInt(ss0[1]);

		// 1行目個数、2行目以降文字列を配列に格納
		ss0 = new String[M];
		int[] a = new int[M*2];
		int[] b = new int[M*2];
		int[] hashi = new int[N+1]; //橋の本数
		for(int i = 0; i < M; i++){
			ss0 = br.readLine().trim().split(" ", 0);
			a[i] = Integer.parseInt(ss0[0]);
			b[i] = Integer.parseInt(ss0[1]);
			
			//双方向なので、相手情報も自分に入れる
			a[i+M]=b[i];
			b[i+M]=a[i];
			
			//橋の本数を数える
			hashi[a[i]] += 1; 
			hashi[b[i]] += 1; 
		}
		//checkInput(a);
		//checkInput(b);
		//checkInput(hashi);

		ss0 = br.readLine().trim().split(" ", 0);
		int Q = Integer.parseInt(ss0[0]);
		int[] v = new int[Q];
		int[] d = new int[Q];
		int[] c = new int[Q];
		for(int i = 0; i < Q; i++){
			ss0 = br.readLine().trim().split(" ", 0);
			v[i] = Integer.parseInt(ss0[0]);
			d[i] = Integer.parseInt(ss0[1]);
			c[i] = Integer.parseInt(ss0[2]);
		}

		int[] ans = new int[N+1];
		int[] sumi = new int[N+1];

		//checkInput(a);
		//checkInput(b);
		//checkInput(v);
		//checkInput(d);
		//checkInput(c);
		//checkInput(ans);
		
		//
		//
		int kiten = 0;
		int kyori = 0;
		int iro = 0;
		
		//Q回、繰り返す
		for(int i = 0; i < Q; i++){
			kiten = v[i];
			kyori = d[i];
			iro = c[i];
			
			ironuri(kiten, kyori, iro, a, b, ans, sumi, hashi);
			for(int j = 0; j < N+1; j++){
				sumi[j] = 0;
			}
			//dp(i + ": ans = "); checkInput(ans);
		}

		for(int j = 1; j < N+1; j++){
			System.out.println(ans[j]);
		}

        //System.out.println(ans);
        return;
    }
    //-----------------------------------------------------------------
    // Debug.Print
    static void dp(String s) {
		//System.out.println(s);
	}
    static void dp(StringBuilder s) { dp(s.toString()); }
    static void dp(int i) { dp(String.valueOf(i)); }
    static void dp(long i) { dp(String.valueOf(i)); }

	//
	static void ironuri(int kiten, int kyori, int iro, int[] a, int[] b, int[] ans, int[] sumi, int[] hashi) {
		//基本動作：自分を塗って、次に渡す
		dp("初期値：kyori=["+kyori+"], kiten=["+kiten+"], sumi[kiten]=["+sumi[kiten]+"], hashi[kiten]=["+hashi[kiten]+"]");
		
		//自分を塗る
		ans[kiten] = iro;
		
		//次を探して渡す
			//自分に橋が無いなら終わり(→探す意味がない)
			if(hashi[kiten]==0){ return; }
		
			//距離を減らす。足りなければ終わり
			kyori -= 1;
			if(kyori < 0){ return; }
		
		int hashi_count=0;
		for(int i=0; i<a.length-1; i++) {
			if(hashi_count > hashi[kiten]) { break; } //探し終わってるなら、そこで終了
			
			//自分とつながる相手に、同じ事をさせる(再帰させる)
			if(a[i]==kiten){
				hashi_count += 1;
				ironuri(b[i], kyori, iro, a, b, ans, sumi, hashi);
			}
		}
		
	}

	//-----------------------------------------------------------------
	// 入力値確認：リスト
	static void checkInput(List l) { System.out.println(l); }
	//-----------------------------------------------------------------
	// 入力値確認：配列、1次元、float型
	//   ＜使い方＞
	//     float[] f = new float[N];
	//     checkInput(f);
	static void checkInput(float[] i1) {
		StringBuilder sb = new StringBuilder();
		for(float i: i1) sb.append("[" + i + "]");
		System.out.println(sb);
	}
	//-----------------------------------------------------------------
	// 入力値確認：配列、1次元、int型
	//   ＜使い方＞
	//     int[] c = new int[N];
	//     checkInput(c);
	static void checkInput(int[] i1) {
		StringBuilder sb = new StringBuilder();
		for(int i: i1) sb.append("[" + i + "]");
		System.out.println(sb);
	}
	static void checkInput(long[] i1) {
		StringBuilder sb = new StringBuilder();
		for(long i: i1) sb.append("[" + i + "]");
		System.out.println(sb);
	}
	//-----------------------------------------------------------------
	// 入力値確認：配列、二次元、int型
	static void checkInput(int[][] i2) {
		StringBuilder sb = new StringBuilder();
		for(int[] i1: i2){
			for(int i: i1) sb.append("[" + i + "]");
			sb.append(System.getProperty("line.separator"));
		}
		System.out.println(sb);
	}
	//-----------------------------------------------------------------
	// 入力値確認：配列、二次元、int型
	static void checkInput(long[][] i2) {
		StringBuilder sb = new StringBuilder();
		for(long[] i1: i2){
			for(long i: i1) sb.append("[" + i + "]");
			sb.append(System.getProperty("line.separator"));
		}
		System.out.println(sb);
	}

}

//-----------------------------------------------------------
//-----------------------------------------------------------