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.io.*;
import java.util.*;

public class B {
	
	static ArrayList<Edge>[] adjList;
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader f = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);
		Scanner s = new Scanner(System.in);
		
		String[] split = f.readLine().split("\\s+");
		int n = Integer.parseInt(split[0]), m = Integer.parseInt(split[1]);
		adjList = new ArrayList[n+1];
		for(int i = 0; i <= n; i++) {
			adjList[i] = new ArrayList<Edge>();
		}
		for(int i = 0; i < m; i++) {
			split = f.readLine().split("\\s+");
			int u = Integer.parseInt(split[0]), v = Integer.parseInt(split[1]), c = Integer.parseInt(split[2]);
			adjList[u].add(new Edge(u, v, c));
			adjList[v].add(new Edge(v, u, c));
		}
		int q = Integer.parseInt(f.readLine());
		for(int i = 0; i < q; i++) {
			boolean[] V = new boolean[n+1];
			TreeSet<Integer> colorsInPath = new TreeSet<Integer>();
			split = f.readLine().split("\\s+");
			int u = Integer.parseInt(split[0]), v = Integer.parseInt(split[1]);
			V[u] = true;
//			if(u == 1 && v == 4) {
			int ans = dfs(u, v, V, colorsInPath);
			System.out.println(Math.max(ans, 0));
//			System.out.println();
//			}
		}
	}
	
	static int dfs(int at, int target, boolean[] V, TreeSet<Integer> colorsInPath) {
//		System.out.println("At " + at);
		if(at == target) return 1;
		int res = 0;
		for(int i = 0; i < adjList[at].size(); i++) {
			int des = adjList[at].get(i).des;
			if(!V[des]) {
//				System.out.printf("%d --> %d: unvisited\n", at, des);
				V[des] = true;
				for(int j = 0; j < adjList[at].size(); j++) {
					int newDes = adjList[at].get(j).des, curCol = adjList[at].get(j).c;
					if(newDes == des) {
						if(colorsInPath.isEmpty() || colorsInPath.contains(curCol)) {
							TreeSet<Integer> newOne = new TreeSet<Integer>();
							newOne.add(curCol);
//							System.out.printf("Going on Color %d\n", curCol);
							boolean[] newV = new boolean[V.length];
							for(int k = 0; k < V.length; k++) newV[k] = V[k];
							int val = dfs(newDes, target, newV, newOne);
							if(val != -1) res += val;
							else {
//								System.out.printf("%d --> %d: Failed\n", at, des);
							}
						} else {
//							System.out.printf("Cant work with color %d cause %d\n", curCol, colorsInPath.first());
						}
					}
				}
//				V[des] = false;
			}
		}
		return res;
	}
	
}

class Edge {
	int src, des, c;
	public Edge(int s, int d, int c) {
		src = s;
		des = d;
		this.c = c;
	}
	
	public String toString() {
		return src + " " + des + " " + c;
	}
}