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 ColorfulGraph {

    private static boolean bfs(List<List<Integer>> map, int s, int e) {
        int n = map.size();
        boolean[] visited = new boolean[n];
        Queue<Integer> qu = new LinkedList<Integer>();
        visited[s] = true;
        qu.offer(s);
        while(qu.size() > 0) {
            int node = qu.poll();
            if(node == e)
                return true;
            for(int i : map.get(node)) {
                if(visited[i] == false) {
                    visited[i] = true;
                    qu.offer(i);
                }
            }
        }
        return false;
    }

    public static int solve(HashMap<Integer, List<List<Integer>>> graph, int s, int e) {
        int res = 0;
        for(int i : graph.keySet()) {
            if(bfs(graph.get(i), s, e))
                res++;
        }
        return res;
    }

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        int m = scan.nextInt();
        HashMap<Integer, List<List<Integer>>> graph = new HashMap<Integer, List<List<Integer>>>();
        for(int i = 0; i < m; i++) {
            int a = scan.nextInt() - 1;
            int b = scan.nextInt() - 1;
            int c = scan.nextInt();
            if(graph.containsKey(c) == false) {
                List<List<Integer>> map = new ArrayList<List<Integer>>();
                for(int j = 0; j < n; j++) {
                    List<Integer> list = new ArrayList<Integer>();
                    map.add(list);
                }
                map.get(a).add(b);
                map.get(b).add(a);
                graph.put(c, map);
            }
            else {
                graph.get(c).get(a).add(b);
                graph.get(c).get(b).add(a);
            }
        }
        int q = scan.nextInt();
        for(int i = 0; i < q; i++) {
            int a = scan.nextInt() - 1;
            int b = scan.nextInt() - 1;
            System.out.println(solve(graph, a, b));
        }
    }

}