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.IOException;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.Scanner;
import java.util.concurrent.ArrayBlockingQueue;

/**
 * IMPORTANT: O nome da classe deve ser "Main" para que a sua solução execute
 * Class name must be "Main" for your solution to execute El nombre de la clase
 * debe ser "Main" para que su solución ejecutar
 */
public class Main {
static  int maxn = 200;
    
static  int n,m,q;
    
static  int[][] fa = new int[maxn][maxn];
    public static void main(String[] args) throws IOException {

        Scanner scanner = new Scanner(System.in);    
         
            n = scanner.nextInt();
            m = scanner.nextInt();
            init();
            for(int i=0;i<m;i++)
            {
                int a,b,c;
                a = scanner.nextInt();
                b = scanner.nextInt();
                c = scanner.nextInt();
                Union(c,a,b);
            }
            q = scanner.nextInt();
            while(q-- > 0)
            {
                int u,v;
                u = scanner.nextInt();
                v = scanner.nextInt();
                int temp = 0;
                for(int i=1;i<=m;i++)
                {
                    int a = find(i,u);
                    int b = find(i,v);
                    if(a==b) temp++;
                }
                System.out.println(temp);
            }
           
        
    }

    static void init()
    {
        for(int i=0;i<200;i++)
            for(int j=0;j<200;j++)
                fa[i][j]=j;
    }

    static int find(int c,int x)
    {
        if(fa[c][x]==x) return x;
        return fa[c][x]=find(c,fa[c][x]);
    }

    static void Union(int c,int a,int b)
    {
        a = find(c,a);
        b = find(c,b);

        if(a==b) return ;

        fa[c][a]=fa[c][b];
    }

}