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

public class KitayutaColorfulGraph505B
{
    public static class DisjointSet
    {
        private int[] id;  // id[i] is the parent of i

        /**
         * Constructor for objects of class DisjointSet (N disjoint elements to start with)
         */
        public DisjointSet(int N)
        {
            id = new int[N];
            for (int i=0; i<N; i++)
            {
                id[i] = i;
            }
        }

        private int root(int i)
        {
            while (i != id[i])
            {
                i = id[i];
            }
            return i;
        }

        public boolean find(int p, int q)  // Are they in the same set?
        {
            return root(p) == root(q);
        }

        public void union(int p, int q)
        {
            int i = root(p);
            int j = root(q);
            id[i] = j;
        }
    }
    
    public static void main(String[] args) 
    {
        // Set up scanner
        Scanner sc = new Scanner(System.in); 
        // System.out.println("Enter n");    // Number of vertices
        int n = sc.nextInt();
        // System.out.println("Enter m");    // Number of edges AND COLORS
        int m = sc.nextInt();
        
        // IDEA:  Have an array of disjoint sets, one for each color
        DisjointSet[] arr = new DisjointSet[m+1];  // Zero based
        for (int i=1; i<=m; i++)
        {
            arr[i] = new DisjointSet(n);    // n disjoint objects in each set to start with
        }
        
        // Enter all the edges
        for (int i=0; i<m; i++)
        {
            // System.out.println("Enter a");
            int a = sc.nextInt();
            // System.out.println("Enter b");
            int b = sc.nextInt();
            // System.out.println("Enter c");
            int c = sc.nextInt();
            
            DisjointSet ds = arr[c];     // Get the set for that color
            ds.union(a-1, b-1);       // Subtract since DisjointSet is zero-based
        }
        
        // Now get the queries
        // System.out.println("Input number of queries");
        int q = sc.nextInt();
        for (int i=0; i<q; i++)
        {
            // System.out.println("Input first vertex");
            int u = sc.nextInt();
            // System.out.println("Input second vertex");
            int v = sc.nextInt();
            int thisanswer = 0;
            for (int j=1; j<=m; j++)    // Loop over all colors
            {
                DisjointSet ds = arr[j];
                if (ds.find(u-1, v-1))
                {
                    thisanswer++;
                }
            }
            System.out.println(thisanswer);
        }
    }
}
                
            
            
        
        
