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.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class hello65 {
	static int vertex;
	static int edge;
	static graphInfo[] gi;

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);
		vertex = input.nextInt();
		edge = input.nextInt();
		// int[][] info = new int[vertex][vertex];
		gi = new graphInfo[edge + 1];
		for (int i = 1; i <= edge; i++) {
			gi[i] = new graphInfo();
			gi[i].info = new int[vertex + 1][vertex + 1];
		}
		for (int i = 0; i < edge; i++) {
			int from = input.nextInt();
			int to = input.nextInt();
			int graph = input.nextInt();
			gi[graph].info[from][to] = 1;
			gi[graph].info[to][from] = 1;
		}
		int numberQ = input.nextInt();
		for (int i = 0; i < numberQ; i++) {
			int ans = 0;
			int from = input.nextInt();
			int to = input.nextInt();
			for (int j = 1; j < gi.length; j++) {
				ans += solve(from, to, j);
			}
			System.out.println(ans);
		}

	}

	public static int solve(int from, int to, int number) {
		Queue<Integer> q = new LinkedList<Integer>();
		// if(gi[number])
		q.add(from);
		boolean[] hasA = new boolean[vertex+1];
		while (!q.isEmpty()) {
			int get = q.poll();
			hasA[get] = true;
			for (int i = 1; i <= vertex; i++) {
				if (gi[number].info[get][i] == 1 && !hasA[i]) {
					if (i == to) {
						return 1;
					}
					q.add(i);
				}
			}
		}
		return 0;
	}
}

class graphInfo {
	int[][] info;
}
