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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;


public class B505 {
	static int count = 0;
	
	public static class Node {
		HashMap<Integer, ArrayList<Node>> color;
		boolean visited = false;
		public Node(int m){
			color = new HashMap<Integer, ArrayList<Node>>();
			
			for (int i = 1; i <= m; i++) {
				color.put(i, new ArrayList<Node>());
			}
		}
	}
	
	public static void BFS(Node start_node, Node end_node, int color){
		start_node.visited = true;
		if (start_node == end_node) {
			count++;
			return;
		}
		for (int i = 0; i < start_node.color.get(color).size(); i++) {
			if (start_node.color.get(color).get(i).visited == false) {
				BFS(start_node.color.get(color).get(i), end_node, color);
			}
		}
		start_node.visited = true;
	}

	public static void main(String[] args) throws IOException {
		
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		String[] input = bf.readLine().split(" ");
		int n = Integer.parseInt(input[0]);
		int m = Integer.parseInt(input[1]);
		ArrayList<Node> nodes = new ArrayList<Node>();
		for (int i = 0; i < n; i++) {
			nodes.add(new Node(m));
		}
//		System.out.println(nodes.get(3).equals(nodes.get(3)));
//		nodes.get(0).color.get(1).add(nodes.get(1));
//		System.out.println(nodes.get(0).color.get(1).size());
		//create edge
		for (int i = 0; i < m; i++) {
			input = bf.readLine().split(" ");
			int a = Integer.parseInt(input[0])-1;
			int b = Integer.parseInt(input[1])-1;
			int c = Integer.parseInt(input[2]);
			nodes.get(a).color.get(c).add(nodes.get(b));
			nodes.get(b).color.get(c).add(nodes.get(a));
		}
		//query
		input = bf.readLine().split(" ");
		int Q = Integer.parseInt(input[0]);
		for (int q = 0; q < Q; q++) {
			input = bf.readLine().split(" ");
			int u = Integer.parseInt(input[0])-1;
			int v = Integer.parseInt(input[1])-1;
			for (int color = 1; color <= m; color++) {
				BFS(nodes.get(u), nodes.get(v), color);
				for (int i = 0; i < n; i++) {
					nodes.get(i).visited = false;
				}
			}
			System.out.println(count);
			count = 0;
		}
	}
}
