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

public class Ques2{
    static ArrayList []a;
    static ArrayList []temp;
    
    static boolean []v;
    static int []color=new int[101];
    //static int temp[][]=new int[101][101];
    public static void dfs(int i,int clr){
                
        v[i]=true;
        //System.out.println(v[i]+"\t"+i);
        for(int j=0;j<a[i].size();j++){
            int t=(Integer)a[i].get(j);
            //System.out.println(t);
            for(int k=0;k<temp[i].size();k++)
                 {
                    int xx=(Integer)temp[i].get(j);
                    if(!v[t] && xx==clr)
                      dfs(t,clr);
                  }
            

        }
    


    }

    public static void main(String[] args){
        Scanner s=new Scanner(System.in);
        int n=s.nextInt();
        int m=s.nextInt();
        a=new ArrayList [n];
        for(int i=0;i<a.length;i++)
            a[i]=new ArrayList<Integer>();
           
            temp=new ArrayList [101];  
        for(int i=0;i<101;i++)
            temp[i]=new ArrayList<Integer>();    
        
        
        for(int i=0;i<m;i++)
        {
            int x=s.nextInt();
            int y=s.nextInt();
            int c=s.nextInt();
            a[x-1].add(y-1);
            a[y-1].add(x-1);
            color[c]=1;
            temp[x-1].add(c);
            temp[y-1].add(c);
            //temp[y-1][x-1]=c;
        }

        v=new boolean[n];
        int test=s.nextInt();
        for(int query=1;query<=test;query++){
        int u=s.nextInt()-1;
        int v1=s.nextInt()-1;
        int ans=0;
        for(int j=0;j<101;j++){
        //for(int i=0;i<a.length;i++){
           
            if (color[j]==1)
                           {
                             dfs(u,j);
                               if (v[v1])
                               {
                                  ans=ans+1;
                                  //System.out.println("saurabh"+j);
                                  
                                  for (int k=0; k<n; k++)
                                       v[k]=false;          
                                  }
                               
                            }
             //}
             
               }
           System.out.println(ans);
}
        

    }


}