Mr. Kitayuta has just bought an undirected graph with 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 ≤ 105, 1 ≤ m ≤ 105), 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 ≤ 105), 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. 
import java.util.Scanner;

public class MrKitayutasColorfulGraph {

	private static Scanner input;

	class DisjointSet {

		private int[] parent;

		public DisjointSet(int size) {
			parent = new int[size + 1];
			for (int i = 0; i < size + 1; i++) {
				parent[i] = -1;
			}
		}

		public void union(int x, int y) {
			int i = find(x);
			int j = find(y);
			if (i != j) {
				parent[i] = j;
			}
		}

		public int find(int i) {
			if (parent[i] == -1) {
				return i;
			}
			return parent[i] = find(parent[i]);
		}

		public boolean isConnected(int x, int y) {
			return find(x) == find(y);
		}
		
	}

	public static void main(String[] args) {

		input = new Scanner(System.in);

		int verticesN, edgesN, queriesN;

		verticesN = input.nextInt();
		edgesN = input.nextInt();

		DisjointSet[] ds = new DisjointSet[edgesN + 1];
		for (int i = 0; i < edgesN + 1; i++) {
			MrKitayutasColorfulGraph object = new MrKitayutasColorfulGraph();
			ds[i] = object.new DisjointSet(verticesN);
		}

		for (int i = 0; i < edgesN; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			int c = input.nextInt();
			ds[c].union(a, b);
		}

		queriesN = input.nextInt();
		int[] output = new int[queriesN];

		for (int i = 0; i < queriesN; i++) {
			int a = input.nextInt();
			int b = input.nextInt();
			for (int j = 1; j < edgesN + 1; j++) {
				if (ds[j].isConnected(a, b)) {
					output[i]++;
				}
			}
		}

		for (int i = 0; i < queriesN; i++) {
			System.out.println(output[i]);
		}

	}
}