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.*;




public class Main {
    static Scanner input = new Scanner(System.in);
    final static double EPS = 1e-8;
    static char[][] arr1;
    static ArrayList<ArrayList<Pair>> graph;
    static boolean[] vis;
    static int n; 
    static int m; 
    static ArrayList<Integer> lengths;
    static Stack<Integer> s = new Stack<>();
    static ArrayList<Integer> topo;
    static int count;
    static int arr[];
    static char[] charArr;
    static String word;
    static int[] d;
 
    public static class Pair{
    	int x;
    	int y;
    	
    	public Pair(int x, int y) {
    		this.x = x;
    		this.y = y;
		}
    	@Override
    	public String toString() {
    		return "(" + x + ", " + y + ")";
    	}
    } 
    
  
    
    //throws Throwable {
	//Scanner input = new Scanner(new FileReader("input.txt"));
	//PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	

    public static boolean dfs(Pair start, int target, int color) {
    	int node = start.x;
    	int nodeColor = start.y;
    	
    	if (nodeColor != -1 && (vis[node] || nodeColor != color))
    		return false;
    	if (node == target)
    		return true;
    	
    	vis[node] = true;
    	
    	ArrayList<Pair> children = graph.get(node);

    	for (int i = 0; i < children.size(); i++) {
    		Pair child = children.get(i);
    		
    		if (!vis[child.x]) 
    			if (dfs(child, target, color))
    				return true;
    	}
    	
    	return false;	
    }
    
   
    public static void main(String[] args) {
    	
    	/*
    	ArrayList <HashSet<Integer>> graph = new ArrayList<HashSet<Integer>>(m);
    	for (int i = 0; i < m; i++)
    		graph.add(new HashSet<Integer>());
    	
    	for (int i = 0; i < m; i++) {
    		int a = input.nextInt();
    		int b = input.nextInt();
    		int c = input.nextInt() - 1;
    		
    		HashSet<Integer> h = graph.get(c);
    		
    		h.add(a);
    		h.add(b);
    	}
    
    	
    	int q = input.nextInt();
    	
    	for (int i = 0; i < q; i++) {
    		int u = input.nextInt();
    		int v = input.nextInt();
    		
    		int count = 0;
    		
    		for (int j = 0; j < m; j++) {
        		HashSet<Integer> h = graph.get(j);
        		if (h.contains(u) && h.contains(v))
        			count++;
    		}
    		
    		System.out.println(count);	
    	}
    	
    	
    	
   */
    	int n = input.nextInt();
    	int m = input.nextInt();
    	
    	graph = new ArrayList<ArrayList<Pair>>(n + 1);
    	
    	for (int i = 0; i < n + 1; i++)
    		graph.add(new ArrayList<Pair>());
    	//System.out.println(graph);
    	
    	for (int i = 0; i < m; i++) {
    		int a = input.nextInt();
    		int b = input.nextInt();
    		int c = input.nextInt();
    		
    		graph.get(a).add(new Pair(b, c));
    		graph.get(b).add(new Pair(a, c));
    	}
    	//System.out.println(graph);

    	
    	
    	int q = input.nextInt();
    	
    	for (int i = 0; i < q; i++) {
    		int u = input.nextInt();
    		int v = input.nextInt();
    		
    		vis = new boolean[n + 1];
    		int count = 0;
    		for (int j = 0; j <= m; j++) {
    		
    			if (dfs(new Pair(u, -1), v, j))
    				count++;
    			
    			Arrays.fill(vis, false);
    		}
    		System.out.println(count);
    		
    	}
    	
    	
    	
    	
    	
    	
    	
  	
    }
}