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.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution{
	public class Vertex{
		int id;
		List<Edge> edges;
		public Vertex(int t_id){
			id = t_id;
			edges = new ArrayList<Edge>();
		}
	}

	public class Edge{
		int des;
		int color;
		public Edge(int t_des, int t_color){
			des = t_des;
			color = t_color;
		}
	}

	int n, m;
	Vertex[] vList;

	public Solution(int t_n, int t_m){
		n = t_n;
		m = t_m;
		vList = new Vertex[n];
		for(int i = 0; i < n; i++){
			vList[i] = new Vertex(i);
		}
	}

	public int solve(int v1, int v2){
		int result = 0;
		boolean[] record = new boolean[n];
		for(int i = 1;i <= m; i++){
			Arrays.fill(record, true);
			if(solveByColor(v1, v2, i, record))
				result ++;
		}
		return result;
	}

	public boolean solveByColor(int v1, int v2, int color, boolean[] record){
		if(v1 == v2)
			return true;
		if(! record[v1])
			return false;
		record[v1] = false;
		for(int i = 0; i < vList[v1].edges.size(); i++){
			Edge tempEdge = vList[v1].edges.get(i);
			if(tempEdge.color != color)
				continue;
			boolean tempResult = solveByColor(tempEdge.des, v2, color, record);
			if(tempResult)
				return true;
		}
		record[v1] = true;
		return false;
	}
	public void addEdge(int v1, int v2, int color){
		vList[v1].edges.add(new Edge(v2, color));
		vList[v2].edges.add(new Edge(v1, color));
	}

	public static void main(String[] args){
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int m = scan.nextInt();
		Solution solution = new Solution(n, m);
		for(int i = 0; i < m; i++){
			int v1 = scan.nextInt();
			int v2 = scan.nextInt();
			int color = scan.nextInt();
			solution.addEdge(v1 - 1, v2 - 1, color);
		}
		int qCount = scan.nextInt();
		for(int i = 0; i < qCount; i++){
			int v1 = scan.nextInt();
			int v2 = scan.nextInt();
			System.out.println(solution.solve(v1 - 1, v2 - 1));
		}
		scan.close();
	}
}