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.

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.

Examples

Input

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


Output

2
2
2
2
2
1
0


Input

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


Output

1
0
3
1
5
5
3
3
6
1
3
4
5
3
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

/**
 * Created by Meepo on 4/1/2017.
 */
public class Main {
    BufferedReader br;
    StringTokenizer st;
    PrintWriter out;

    public String nextToken() throws IOException {
        while (st == null || !st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public void solveA() throws IOException {
        int n = nextInt();
        int[] a = new int[3 * n];
        for (int i = 0; i < 3 * n; i++) {
            a[i] = nextInt();
        }
        Arrays.sort(a);
        long ans = 0;
        for (int i = 0; i < n; i++) {
            ans += a[3 * n - 2 * i - 2];
        }
        out.println(ans);
    }

    public void solveB() throws IOException {
        int n = nextInt();
        int m = nextInt();
        ArrayList<Integer>[] e = new ArrayList[n];
        for (int i = 0; i < e.length; i++) {
            e[i] = new ArrayList<>();
        }
        for (int i = 0; i < m; i++) {
            int a = nextInt() - 1;
            int b = nextInt() - 1;
            e[a].add(b);
            e[b].add(a);
        }

        int[][] color = new int[n][11];

        for (int i = 0; i < n; i++) {
            Arrays.fill(color[i], -1);
        }

        int q = nextInt();
        int[] c = new int[q];
        for (int i = 0; i < q; i++) {
            int v = nextInt() - 1;
            int d = nextInt();
            c[i] = nextInt();
            color[v][d] = i;
        }

        boolean change = true;
        while (change) {
            change = false;
            for (int v = 0; v < e.length; v++) {
                for (int d = 1; d < color[v].length; d++) {
                    if (color[v][d] == -1) {
                        continue;
                    }
                    for (int u : e[v]) {
                        if (color[u][d - 1] < color[v][d]) {
                            color[u][d - 1] = color[v][d];
                            change = true;
                        }
                    }
                }
            }
        }

        for (int i = 0; i < n; i++) {
            int ans = -1;
            for (int j = 0; j < color[i].length; j++) {
                ans = Math.max(ans, color[i][j]);
            }
            out.println(ans == -1 ? 0 : c[ans]);
        }
    }

    public void run() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);

            solveB();

            out.close();
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    public static void main(String[] args) {
        new Main().run();
    }
}
