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.*;
import java.util.*;
public class CF_500B {
    public static void main(String[] args) throws IOException {
        new CF_500B().solve();
    }

    int root(int[]p , int i){
        if (p[i]==i) return i;
        else return p[i]=root(p, p[i]);
    }
    
    void fillConnections(ArrayList<ArrayList<Integer>> gr, boolean[][]connect){
        int[] p=new int[connect.length];
        for (int i=0;i<p.length;i++)
            p[i]=i;
        for (int i=0;i<gr.size();i++)
            for (Integer nb:gr.get(i))
                p[root(p,nb)]=root(p,i);
        for (int i=0;i<connect.length;i++)
            for (int j=i+1;j<connect.length;j++)
                if (root(p,i)==root(p, j))
                    connect[i][j]=connect[j][i]=true;
    }
    
    
    void solve() throws IOException{
        
        InputStream in = System.in;
        PrintStream out = System.out;

//        in = new FileInputStream("in.txt");
//        out = new PrintStream("out.txt");

        Scanner sc=new Scanner(in);        
        int n=sc.nextInt(), m=sc.nextInt();
        boolean[][][] con=new boolean[m][n][n];
        HashMap<Integer, ArrayList<ArrayList<Integer>>> totalGr=
                new HashMap<Integer, ArrayList<ArrayList<Integer>>>();
        for (int t=0;t<m;t++){
            int a=sc.nextInt()-1, b=sc.nextInt()-1, c=sc.nextInt()-1;
            if (!totalGr.containsKey(c)){
                ArrayList<ArrayList<Integer>> gr=new ArrayList<ArrayList<Integer>>();
                for (int i=0;i<n;i++)
                    gr.add(new ArrayList<Integer>());
                totalGr.put(c, gr);
            }
            totalGr.get(c).get(a).add(b);
            totalGr.get(c).get(b).add(a);
        }
        for (Integer c:totalGr.keySet())
            fillConnections(totalGr.get(c),con[c]);
        
        int q=sc.nextInt();
        for (int t=0;t<q;t++){
            int u=sc.nextInt()-1, v=sc.nextInt()-1, count=0;
//            System.out.println(u+" "+v);

            
            for (Integer c:totalGr.keySet())
                if (con[c][u][v])
                    count++;
            out.println(count);
        }
            
            
    }
}