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.*;
import java.math.*;
import java.io.*;
import java.text.*;
import java.awt.Point;

import static java.util.Arrays.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import static java.lang.Long.*;
import static java.lang.Short.*;
import static java.lang.Math.*;
import static java.math.BigInteger.*;
import static java.util.Collections.*;

public class B {

	private Scanner in;
	private StringTokenizer st;
	private PrintWriter out;

	private DecimalFormat fmt = new DecimalFormat("0.0000000000");

	private List<Edge>[] g;
	private HashSet<Integer> vis;
	public void solve() throws Exception {
		int n = in.nextInt();
		int m = in.nextInt();

		g = new List[n + 1];

		for (int i=1; i<=n; i++) {
			g[i] = new ArrayList<Edge>();
		}

		for (int i=0; i<m; i++) {
			int u = in.nextInt();
			int v = in.nextInt();
			int c = in.nextInt();

			g[u].add(new Edge(v, c));
			g[v].add(new Edge(u, c));
		}

		int q = in.nextInt();
		vis = new HashSet<Integer>();

		while (q --> 0) {
			vis.clear();
			counter = 0;
			int u = in.nextInt();
			int v = in.nextInt();
			vis.add(u);
			dfs(-1, u, v);

			out.println(counter);
		}
	}

	private int counter = 0;

	private void dfs(int color, int u, int dest) {
		if (u == dest) {
			counter ++;
			return;
		}

		for (Edge e : g[u]) {
			int tmp;
			if (color == -1) {
				tmp = e.color;
			} else {
				tmp = color;
			}

			if (e.color == tmp && !vis.contains(e.node)) {
				vis.add(e.node);
				dfs(tmp, e.node, dest);
				vis.remove(e.node);
			}
		}
	}

	private class Edge {
		int color;
		int node;

		public Edge(int node, int color) {
			this.color = color;
			this.node = node;
		}
	}

	public B() {
		this.in = new Scanner(System.in);
		this.out = new PrintWriter(System.out);
	}

	public void end() {
		try {
			this.out.flush();
			this.out.close();
			this.in.close();
		} catch (Exception e){
			//do nothing then :)
		}
	}

	public static void main(String[] args) throws Exception {
		B solver = new B();
		solver.solve();
		solver.end();
	}
}
