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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;


public class B286 {
    
    static ArrayList<Integer>[][] g;
    static int n;

    public static void main(String[] args) throws IOException {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        
        String[] s =br.readLine().split(" ");
        
        n=Integer.parseInt(s[0]);
        int m=Integer.parseInt(s[1]);
        
        g=new ArrayList[n][n];
        
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                g[i][j]=new ArrayList<>();
            }
        }
        
        int max=0;
        for(int i=0;i<m;i++){
            s=br.readLine().split(" ");
            
            int a=Integer.parseInt(s[0])-1;
            int b=Integer.parseInt(s[1])-1;
            
            int c=Integer.parseInt(s[2]);
            
            g[a][b].add(c);
            g[b][a].add(c);
            
            max=c>max?c:max;
            
        }
        
        int q=Integer.parseInt(br.readLine());
        for(int i=0;i<q;i++){
            s =br.readLine().split(" ");
            
            int u=Integer.parseInt(s[0])-1;
            int v=Integer.parseInt(s[1])-1;
            
            int counter=0;
            boolean[] vis;
            
            for(int j=0;j<=max;j++){
                vis=new boolean[n];
                shofKdaFi(u, v, j, vis);
                
                if(vis[v])
                    counter++;
                
            }
            System.out.println(counter);
        }
        
    }

    public static void shofKdaFi(int u, int v, int c, boolean[] vis) {
        
        vis[u]=true;
        if(u==v){
            return;
        }

        for(int i=0;i<n;i++){
            if(g[u][i].contains(c) && !vis[i]){
                shofKdaFi(i, v, c, vis);
            }
        }
    }
}
