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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.StringTokenizer;

public class P10 {

	private static InputReader ir;
	private static PrintWriter out;
	private static ArrayList<HashMap<Integer, ArrayList<Integer>>> nodes;
	private static HashSet<Integer> beenVisited;
	
	public static void main(String[] args) {
		ir = new InputReader(System.in);
		out = new PrintWriter(System.out);
		
		nodes = new ArrayList<HashMap<Integer, ArrayList<Integer>>>();
		beenVisited = new HashSet<Integer>();
		
		populate();
		
		queries();
	}
	
	private static void queries() {
		int q = ir.nextInt();
				
		int u, v;
		for (int i = 0; i < q; i++) {
			u = ir.nextInt() - 1;
			v = ir.nextInt() - 1;
			
			int count = 0;
			for (Integer color: nodes.get(u).keySet()) {
				if (dfs(u, v, color)) {
					count++;
				}
			}
			out.println(count);
		}
		
		out.flush();
	}

	private static boolean dfs(int u, int v, Integer color) {
		boolean hasPath = false;
		beenVisited.add(u);
		if (nodes.get(u).get(color).contains(v)){
			hasPath = true;
		} else {
			for (Integer node: nodes.get(u).get(color)) {
				if (!beenVisited.contains(node)){
					hasPath = hasPath || dfs(node, v, color);
					if (hasPath){
						break;
					}
				}
			}
		}
		beenVisited.remove(u);
		return hasPath;
	}

	private static void populate() {
		int n, m;
		
		n = ir.nextInt();
		m = ir.nextInt();
		
		for (int i = 0; i < n; i++) {
			nodes.add(new HashMap<Integer, ArrayList<Integer>>());
		}
		
		int a, b, c;
		for (int i = 0; i < m; i++) {
			a = ir.nextInt() - 1;
			b = ir.nextInt() - 1;
			c = ir.nextInt() - 1;
			
			if (!nodes.get(a).containsKey(c)){
				nodes.get(a).put(c, new ArrayList<Integer>());
			}
			if (!nodes.get(b).containsKey(c)){
				nodes.get(b).put(c, new ArrayList<Integer>());
			}
			
			nodes.get(a).get(c).add(b);
			nodes.get(b).get(c).add(a);
		}
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

	}
}
