Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int n = sc.nextInt();
		int m = sc.nextInt();
		
		Edge[] edges = new Edge[m];
		for (int i = 0; i < m; i++) {
			int u = sc.nextInt();
			int v = sc.nextInt();
			int c = sc.nextInt();
			
			edges[i] = new Edge(u, v, c);
		}
		
		Arrays.sort(edges);
		
		int[][] res = new int[n+1][n+1];
		
		@SuppressWarnings("unchecked")
		LinkedList<Integer>[] G = new LinkedList[n+1];
		boolean[] visited = new boolean[n+1];
		int pos = 0;
		for (int i = 1; i <= n && pos < m; i++) {
			for (int ii = 0; ii <= n; ii++) {
				G[ii] = new LinkedList<Integer>();
			}
			
			visited = new boolean[n+1];
			
			while(pos < m && edges[pos].c == i) {
				int u = edges[pos].u;
				int v = edges[pos].v;
				G[u].add(v);
				G[v].add(u);
				pos++;
			}
			
			for (int v = 1; v <= n; v++) {
				if (!visited[v]) {
					LinkedList<Integer> cc = bfs(G, v, visited);
					
					for (int k = 0; k < cc.size(); k++) {
						for (int kk = k + 1; kk < cc.size(); kk++) {
							int a = cc.get(k);
							int b = cc.get(kk);
							res[a][b]++;
							res[b][a]++;
						}
					}
				}
			}
		}
		
		int k = sc.nextInt();
		while(k-- > 0) {
			int u = sc.nextInt();
			int v = sc.nextInt();
			System.out.println(res[u][v]);
		}
		
		sc.close();
	}
	
	public static LinkedList<Integer> bfs(LinkedList<Integer>[] G, int s, boolean[] visited) {
		LinkedList<Integer> cc = new LinkedList<Integer>();
		cc.addLast(s);
		visited[s] = true;
		LinkedList<Integer> Q = new LinkedList<Integer>();
		Q.addLast(s);
		while(!Q.isEmpty()) {
			int u = Q.removeFirst();
			for (int v : G[u]) {
				if (!visited[v]) {
					visited[v] = true;
					Q.addLast(v);
					cc.addLast(v);
				}
			}
		}
		
		return cc;
	}
	
	public static class Edge implements Comparable<Edge> {
		int u, v, c;
		
		Edge(int u, int v, int c) {
			this.u = u;
			this.v = v;
			this.c = c;
		}

		@Override
		public int compareTo(Edge e) {
			return Integer.compare(c, e.c);
		}
		
		public String toString() {
			return String.format("(%d, %d, %d)", u, v, c);
		}
		
	}
}