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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
	
	static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
	static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
	static StringTokenizer datos = new StringTokenizer("");
	
	public static String next() throws IOException {
		while (!datos.hasMoreTokens()) {
			String s = in.readLine();
			if (s == null)
				return null;
			datos = new StringTokenizer(s);
		}
		return datos.nextToken();
	}
	
	public static Integer nextInt() throws IOException {
		String s = next();
		return s == null ? null : Integer.parseInt(s);
	}
	public static Long nextLong() throws IOException {
		String s = next();
		return s == null ? null : Long.parseLong(s);
	}
	
	static List<Node>[] graph;
	static boolean visitados[];
	
	public static void main(String[] args) throws IOException 
	{
		int n = nextInt();
		int m = nextInt();
		graph = new List[n];
		for(int i=0;i<n;i++) graph[i] = new ArrayList<Node>();
		for(int i=0;i<m;i++){
			int u = nextInt()-1;
			int v = nextInt()-1;
			int c = nextInt();
			graph[u].add(new Node(v, c));
			graph[v].add(new Node(u, c));
		}
		int q = nextInt();
		while(q-->0){
			int u = nextInt()-1;
			int v = nextInt()-1;
			int res = 0;
			for(int i=1;i<=m;i++){
				visitados = new boolean[n];
				if(dfs(u, v, i)) res++;
			}
			out.println(res);
		}
		out.flush();
	}
	
	public static boolean dfs(int node, int goal, int color)
	{
		if(node == goal) return true;
		visitados[node] = true;
		List<Node> edges = graph[node];
		for(Node n : edges){
			if(n.color == color && !visitados[n.id]){
				if(dfs(n.id, goal, color)) return true;
			}
		}
		return false;
	}
}

class Node
{
	int id;
	int color;
	
	public Node(int i, int c)
	{
		id = i;
		color = c;
	}
}