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


public class Problem_505B {

	static class Graph {
		List<Node> nodes;
		class Edge {
			int s;
			int t;
			int c;
			
			Edge(int s, int t, int c) {
				this.s = s;
				this.t = t;
				this.c = c;
			}
		}
		class Node {
			int i;
			List<Edge> adj;
			
			Node(int i) {
				adj = new ArrayList<>();
				this.i = i;
			}
		}
		
		Graph() {
			nodes = new ArrayList<>();
		}
		
		void addNode(int i) {
			nodes.add( new Node(i) );
		}
		
		void addEdge(int n1, int n2, int c) {
			Edge e1 = new Edge(n1,n2,c);
			Edge e2 = new Edge(n2,n1,c);
			
			nodes.get(n1).adj.add(e1);
			nodes.get(n2).adj.add(e2);
		}
		
		
		Deque<Integer> stack = new ArrayDeque<Integer>();
		List<Integer> visited = new ArrayList<>();
		boolean dfs(int s, int t, int c) {
			stack.clear();
			visited.clear();
			int cur;
			
			stack.push(s);
			while(!stack.isEmpty()) {
				cur = stack.pop();
				if(cur == t) return true;
				visited.add(cur);
				
				for(int i = 0; i < nodes.get(cur).adj.size(); i++) {
					int color = nodes.get(cur).adj.get(i).c;
					int node = nodes.get(cur).adj.get(i).t;
					
					
					if( color  == c && !stack.contains(node) && !visited.contains(node)) {
						//System.out.println("Adding " + node + " to stack");
						stack.push( node );
					}
				}
				
			}
			return false;
		}
	}
	
	
	public static void main(String[] args) {
		
		Graph g = new Graph();
		
		int n,m,q;
		int a,b,c;

		Scanner finput;
	    Integer input;
	    //System.out.println("Enter Data: ");
	    finput = new Scanner(System.in);

	    n = finput.nextInt();
	    m = finput.nextInt();
	    //System.out.println("n,m: " + n + " " + m );
		
	    for(int i = 0; i < n; i++) {
	    	//System.out.println("Adding node: " + i);
	    	g.addNode( i );
	    }
	    
	    for(int i = 0; i < m; i++) {
	    	a = finput.nextInt()-1;
	    	b = finput.nextInt()-1;
	    	c = finput.nextInt()-1;
	    	
	    	g.addEdge(a,b,c);
	    }
	    
	    q = finput.nextInt();
	    int sum = 0;
	    //System.out.println(q);
	    for(int i = 0; i < q; i++) {
	    	a = finput.nextInt()-1;
	    	b = finput.nextInt()-1;
	    	sum = 0;
	    	//System.out.println("Find path from: " + (a+1) + " to " + (b+1));
	    	for(int j = 0; j < m; j++) {
	    		if( g.dfs(a, b, j) ) sum++;
	    		//System.out.println("   " + g.dfs(a, b, j));
	    	}
	    	System.out.println(""+sum);
	    }
	    
	}
}
