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

public class KitayutaColorfulGraph {
    public static void main(String asd[])throws Exception
    {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        int m=in.nextInt();
        int a[][][]=new int[n][n][m+1];
        int b[]=new int[m+1];
        for(int i=0;i<m;i++)
        {
            int q=in.nextInt()-1;
            int w=in.nextInt()-1;
            int c=in.nextInt();
            a[q][w][c]=1;a[w][q][c]=1;
        }
        for(int k=0;k<n;k++){
            for(int i=0;i<n;i++)
                for(int j=0;j<n;j++)
                    for(int g=1;g<=m;g++)
                        if(a[i][k][g]==1 && a[k][j][g]==1){
                            a[i][j][g]=1;
                            a[j][i][g]=1;
                        }
        }
        int k=in.nextInt();int e=0;
        for(int i=0;i<k;i++)
        {
            Arrays.fill(b,0);e=0;
            int u=in.nextInt()-1;
            int v=in.nextInt()-1;
            for(int ii=1;ii<=m;ii++)
                for(int kk=0;kk<n;kk++)
                {
                    if(a[u][v][ii]!=0)
                    {
                        if(b[ii]==0)
                        {
                            e+=1;
                            b[ii]=1;
                        }
                    }
                       }
                    
             System.out.println(e);
        
    }
    }
}
