Mr. Kitayuta has just bought an undirected graph consisting of n vertices and m edges. The vertices of the graph are numbered from 1 to n. Each edge, namely edge i, has a color ci, connecting vertex ai and bi.

Mr. Kitayuta wants you to process the following q queries.

In the i-th query, he gives you two integers — ui and vi.

Find the number of the colors that satisfy the following condition: the edges of that color connect vertex ui and vertex vi directly or indirectly.

Input

The first line of the input contains space-separated two integers — n and m (2 ≤ n ≤ 100, 1 ≤ m ≤ 100), denoting the number of the vertices and the number of the edges, respectively.

The next m lines contain space-separated three integers — ai, bi (1 ≤ ai < bi ≤ n) and ci (1 ≤ ci ≤ m). Note that there can be multiple edges between two vertices. However, there are no multiple edges of the same color between two vertices, that is, if i ≠ j, (ai, bi, ci) ≠ (aj, bj, cj).

The next line contains a integer — q (1 ≤ q ≤ 100), denoting the number of the queries.

Then follows q lines, containing space-separated two integers — ui and vi (1 ≤ ui, vi ≤ n). It is guaranteed that ui ≠ vi.

Output

For each query, print the answer in a separate line.

Examples

Input

4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4


Output

2
1
0


Input

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


Output

1
1
1
1
2

Note

Let's consider the first sample. 

<image> The figure above shows the first sample. 

  * Vertex 1 and vertex 2 are connected by color 1 and 2. 
  * Vertex 3 and vertex 4 are connected by color 3. 
  * Vertex 1 and vertex 4 are not connected by any single color. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

import java.io.InputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class CFS505B {

	public final static String IN_FILE = "test/CFS505B.in";
	public final static String OUT_FILE = "test/CFS505B.out";

	public static void main(String[] args) throws Exception {
		// InputStream in = new FileInputStream(IN_FILE);
		//
		// @SuppressWarnings("resource")
		// PrintStream out = new PrintStream(OUT_FILE);

		InputStream in = System.in;
		PrintStream out = System.out;

		Scanner IN = new Scanner(in);

		int n = IN.nextInt();
		int m = IN.nextInt();

		int[][][] G = new int[n + 1][n + 1][m + 1];
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				Arrays.fill(G[i][j], 0);
			}
		}

		for (int i = 0; i < m; i++) {
			int a = IN.nextInt();
			int b = IN.nextInt();
			int c = IN.nextInt();

			G[a][b][c] = 1;
			G[b][a][c] = 1;
		}

		int q = IN.nextInt();
		int[] u = new int[q];
		int[] v = new int[q];

		for (int i = 0; i < q; i++) {
			u[i] = IN.nextInt();
			v[i] = IN.nextInt();
		}

		IN.close();

		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) {
				for (int k = 1; k <= n; k++) {
					for (int l = 1; l <= m; l++) {
						if (G[i][j][l] == 1 && G[j][k][l] == 1) {
							G[i][k][l] = 1;
						}
					}
				}
			}
		}

		for (int i = 0; i < q; i++) {
			int t = 0;
			for (int j = 1; j <= m; j++) {
				if (G[u[i]][v[i]][j] == 1) {
					t++;
				}
			}
			out.println(t);
		}

	}

}
