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.io.PrintWriter;
import java.util.*;

public class Code_505B_MrKitayuatasColorfulGraph {
    public static void main(String[] args) throws IOException {
        BufferedReader reader=new BufferedReader(new InputStreamReader(System.in));
        PrintWriter out=new PrintWriter(System.out);
        StringTokenizer in=new StringTokenizer(reader.readLine());
        int n=Integer.parseInt(in.nextToken()),m=Integer.parseInt(in.nextToken());
        int[][][] graph=new int[n][n][m];
        for(int i=0;i<m;++i){
            in=new StringTokenizer(reader.readLine());
            int x=Integer.parseInt(in.nextToken())-1,y=Integer.parseInt(in.nextToken())-1,c=Integer.parseInt(in.nextToken())-1;
            graph[x][y][c]=1;
            graph[y][x][c]=1;
        }
        in=new StringTokenizer(reader.readLine());
        int q=Integer.parseInt(in.nextToken());
        while(q-->0){
            in=new StringTokenizer(reader.readLine());
            int u=Integer.parseInt(in.nextToken())-1,v=Integer.parseInt(in.nextToken())-1;
            int total=0;
            for(int c=0;c<m;++c){
                boolean[] isVisited=new boolean[n];
                Queue<Integer> queue=new ArrayDeque<>();
                queue.add(u);
                while(!queue.isEmpty()){
                    int x=queue.poll();
                    isVisited[x]=true;
                    if(x==v){
                        ++total;
                        break;
                    }
                    for(int y=0;y<n;++y){
                        if(!isVisited[y] && graph[x][y][c]==1)queue.add(y);
                    }
                }
            }
            System.out.println(total);
        }
        out.close();
    }
}
