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

public class Main {
	
	static int[][] map=new int[110][110];
	
	static int n,m;
	
	static Scanner scan=new Scanner(System.in);
	
	public static int find(int x,int c,int[][] f)
	{
		if(f[c][x]==0) f[c][x]=x;
		
		if(f[c][x]==x) return x;
		
		int fa=find(f[c][x],c,f);
		
		f[c][x]=fa;
		
		return fa;
	}
	
	public static void print(int x,int y,int[][] f)
	{
		int ans=0;
		
		for(int i=1;i<=100;i++)
		
		if(f[i][x]==f[i][y])  ans++;
		
		System.out.println(ans);
		
	}
	
	public static void work()
	{
	   int[][] f=new int[110][110];
	   
	   for(int i=1;i<=m;i++)
	   {
		   int a=scan.nextInt();   int b=scan.nextInt();  int c=scan.nextInt();
		   
		   int x=find(a,c,f);   
		   
		   int y=find(b,c,f);
		   
		   if(x!=y) f[c][x]=y;
	   }
		   
	   for(int j=1;j<=100;j++)
		   
	   for(int i=1;i<=n;i++)
	    
	   find(i,j,f);
	   
	   int q=scan.nextInt();
	   
	   for(int i=1;i<=q;i++)
	   {
		   int a=scan.nextInt();  int b=scan.nextInt();
		   
		   print(a,b,f);
	   }
	}
	
	public static void main(String[] args)
	{
		n=scan.nextInt();
		
		m=scan.nextInt();
		
		work();
	}

}

	  	 		 	 	 		 			   		 		  		