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.ArrayList;
import java.util.Arrays;
import java.util.Scanner;

public class Test {

	// https://codeforces.com/problemset/problem/505/B

	static Scanner s = new Scanner(System.in);

	static int in() {
		int x = s.nextInt();
		return x;
	}

	static boolean[] vis;
	static ArrayList<ArrayList<Elem>> adj;
	static ArrayList<ArrayList<Integer>> colors;

	static class Elem {
		int node, ecolor;

		Elem(int n, int e) {
			node = n;
			ecolor = e;
		}
	}

	static void dfs(int src, int color) {
		vis[src] = true;
		for (Elem e : adj.get(src)) {
			int u = e.node;
			if (!vis[u] && e.ecolor == color) {
				dfs(u, color);
			}
		}
	}

	static void solve() {
		int n = in();
		int m = in();
		adj = new ArrayList<ArrayList<Elem>>();
		colors = new ArrayList<ArrayList<Integer>>();
		
		for (int i = 0; i <= n; i++) {
			colors.add(new ArrayList<Integer>());
			adj.add(new ArrayList<Elem>());
		}
		
		vis = new boolean[n + 1];
		int[][] numColors = new int[n + 1][n + 1];

		for (int i = 0; i < m; i++) {
			int x = in();
			int y = in();
			int c = in();
			adj.get(x).add(new Elem(y, c));
			adj.get(y).add(new Elem(x, c));
			numColors[x][y]++;
			numColors[y][x]++;
			colors.get(x).add(c);
			colors.get(y).add(c);
		}

		int q = in();
		ArrayList<Integer> ans = new ArrayList<Integer>();
		for (int t = 0; t < q; t++) {
			int u = in();
			int v = in();
			int answer = 0;
			boolean visColor[] = new boolean[m + 1];
			for (int color : colors.get(u)) {
				Arrays.fill(vis, false);
				if (!visColor[color])
					dfs(u, color);
				visColor[color] = true;
				if (vis[v]) {
					++answer;
				}
			}
			ans.add(answer);
		}
		for (int i = 0; i < ans.size(); i++) {
			System.out.println(ans.get(i));
		}
	}

	public static void main(String[] args) {

		solve();

	}

}
