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.AbstractMap;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Queue;
import java.util.Scanner;
import java.util.Set;


public class B505 {
	static List<List<Map.Entry<Integer, Integer>>> nodes = new LinkedList<>();
	static boolean [] visited = null;
	static boolean isValid=false;
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int n = scanner.nextInt();
		int m = scanner.nextInt();
		visited = new boolean[n];
		for (int i = 0; i < n; i++) {
			nodes.add(new LinkedList<>());
		}
		int maxColor = -1;
		for(int i=0; i<m; i++) {
			
			int x = scanner.nextInt()-1;
			int y = scanner.nextInt()-1;
			int c = scanner.nextInt();
			maxColor = Math.max(maxColor, c);
			nodes.get(x).add(new AbstractMap.SimpleEntry<Integer, Integer>(y,c));
			nodes.get(y).add(new AbstractMap.SimpleEntry<Integer, Integer>(x,c));
			}
		
		int q = scanner.nextInt();
		
		Queue<Integer> res = new LinkedList<>();
		while(scanner.hasNextInt()) {
			int n1 = scanner.nextInt()-1;
			int n2 = scanner.nextInt()-1;	
			int count=0;
			for (int c =1; c <= maxColor; c++) {
				Arrays.fill(visited, false);
				dfs(n1, n2, c);
				if(isValid)
					count++;
				isValid=false;
			}
			res.add(count);		
		}
		while(!res.isEmpty()) {
			System.out.println(res.poll());
		}
		
	}
	

	static void dfs(int source, int dest, int color) {
		if(visited[source])
			return ;
		visited[source] = true;
		List<Map.Entry<Integer, Integer>> list = nodes.get(source);
		
		for (Map.Entry<Integer, Integer> entry : list) {
			if(entry.getKey() == dest && entry.getValue() == color) {
				isValid = true;				
			}
			else if(entry.getValue() == color){
				dfs(entry.getKey(), dest, color);				
			}
		}
		
	}
	
}
