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.*;

import javafx.util.Pair;
public class Main {
	class Edge{
		int dest,c;
		Edge(int a,int b){
			dest=a;
			c=b;
		}
	}
	LinkedList<Edge> adj[];
	int V,ans;
	Main(int v){
		V=v;
		adj=new LinkedList[V];
		for(int i=0;i<V;i++)
			adj[i]=new LinkedList<>();
	}
	void addEdge(int u,int v,int c){
		adj[u].add(new Edge(v,c));
		adj[v].add(new Edge(u,c));
	}
	void dfs(int x,int y){
		ans=0;
		boolean[] visited=new boolean[V];
		for(int i=0;i<adj[x].size();i++){
			Arrays.fill(visited, false);
			Edge ob=adj[x].get(i);
			//System.out.println(ob.dest+" "+ob.c);
			visited[x]=true;
			dfsutil(visited,ob.dest,y,ob.c);
		}
		System.out.println(ans);
	}
	void dfsutil(boolean[] visited,int x,int y,int c){
		if(x==y){
			ans++;
			//System.out.println(c);
			return;
		}
		visited[x]=true;
		for(int i=0;i<adj[x].size();i++){
			Edge ob=adj[x].get(i);
			if(visited[ob.dest]==false && ob.c==c)
				dfsutil(visited,ob.dest,y,c);
		}
	}
	public static void main(String args[]){
		Scanner in=new Scanner(System.in);
		int v=in.nextInt();
		int e=in.nextInt();
		Main ob=new Main(v);
		for(int i=0;i<e;i++){
			int x=in.nextInt()-1;
			int y=in.nextInt()-1;
			int c=in.nextInt();
			ob.addEdge(x, y, c);
		}
		int q=in.nextInt();
		for(int i=0;i<q;i++){
			int x=in.nextInt()-1;
			int y=in.nextInt()-1;
			ob.dfs(x,y);
		}
	}
}