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

    public static Scanner in = new Scanner(System.in);

    public static void main(String[] args) {
        int n = in.nextInt();
        int m = in.nextInt();
        Graph graph = new Graph(n);
        for (int i = 0; i < m; i++) {
            int from = in.nextInt();
            int to = in.nextInt();
            int color = in.nextInt();
            graph.addEdge(from, to, color);
        }
        int q = in.nextInt();
        while (q-- > 0) {
            int source = in.nextInt();
            int target = in.nextInt();
            boolean[][] visited = new boolean[101][101];
            HashSet<String> set = new HashSet<String>();
            graph.dfs(source, target, 0, set);
            System.out.println(graph.sol.size());
            graph.sol = new HashSet<Integer>();
        }
    }

    public static class Graph {

        int V;
        ArrayList<Edge>[] data = null;
        HashSet<Integer> sol = null;

        public Graph(int v) {
            this.V = v + 1;
            this.data = new ArrayList[this.V];
            for (int i = 0; i < data.length; i++) {
                data[i] = new ArrayList<Edge>();
            }
            sol = new HashSet<Integer>();;
        }

        public void addEdge(int from, int to, int color) {
            data[from].add(new Edge(to, color));
            data[to].add(new Edge(from, color));
        }

        public void dfs(int source, int target, int lastColor, HashSet<String> set) {
            set.add(source + "" + lastColor);
            if (target == source) {
                sol.add(lastColor);
            } else {

                set.add(source + "" + lastColor);
                ArrayList<Edge> list = data[source];
                for (int i = 0; i < list.size(); i++) {
                    Edge cur = list.get(i);
                    if (lastColor == 0) {
                        if (!set.contains(cur.to + "" + lastColor)) {
                            dfs(cur.to, target, cur.color, set);
                        }
                    } else {
                        if (!set.contains(cur.to + "" + lastColor) && cur.color == lastColor) {

                            dfs(cur.to, target, lastColor, set);
                        }
                    }
                }
            }
        }
    }

    public static class Edge {

        int to;
        int color;

        public Edge(int a, int b) {
            to = a;
            color = b;
        }
    }
}
