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 Main {
    
    static class Node {
        int at;
        ArrayList<Edge> ady;
        Node(int at) {
            this.at = at;
            this.ady = new ArrayList<Edge>();
        }
    }

    static class Edge {
        int color;
        Node node;
        Edge(int color, Node node) {
            this.color = color;  
            this.node = node;
        }        
    }

    static void addEdge(Node from, Node to, int color) {        
        from.ady.add(new Edge(color, to));
        to.ady.add(new Edge(color, from));        
    }

    private static boolean dfs(Node u, Node v, int c, boolean[][] visited) {
        if (u.at == v.at) {
            return true;
        }
        boolean res = false;
        for (Edge edge : u.ady) {
            if (!visited[u.at][edge.node.at] && c == edge.color) {
                visited[u.at][edge.node.at] = true;
                if(dfs(edge.node, v, c, visited)) {
                    return true;
                }
            }
        }
        return res;
    }

    public static void main(String... args) throws IOException {

        //BufferedReader in = new BufferedReader(new FileReader("test.in"));        
        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));        
        StringTokenizer st = new StringTokenizer(in.readLine());
        int n = Integer.parseInt(st.nextToken());
        int m = Integer.parseInt(st.nextToken());
        ArrayList<Node> graph = new ArrayList<Node>();
        TreeSet<Integer> colors = new TreeSet<Integer>();
        
        for (int i = 0; i < n; ++ i) {
            graph.add(new Node(i));
        }        

        for(int i = 0; i < m; ++ i) {
            st = new StringTokenizer(in.readLine());
            int u = Integer.parseInt(st.nextToken()) - 1;
            int v = Integer.parseInt(st.nextToken()) - 1;
            int c = Integer.parseInt(st.nextToken());
            addEdge(graph.get(u), graph.get(v), c);
            colors.add(c);
        }

        int nq = Integer.parseInt(in.readLine());
        for(int i = 0; i < nq; ++ i) {
            st = new StringTokenizer(in.readLine());
            int u = Integer.parseInt(st.nextToken()) - 1;
            int v = Integer.parseInt(st.nextToken()) - 1;
            int res = 0;
            for (int c : colors) {                
                if (dfs(graph.get(u), graph.get(v), c, new boolean[n][n])) {
                    ++ res;
                }
            }
            System.out.println(res);
        }        

    }

}