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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.HashMap;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main
{
    public static void main(String[] args)
    {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB
    {
        public void solve(int testNumber, Scanner in, PrintWriter out)
        {
            int N = in.nextInt();
            int M = in.nextInt();
            Map<Integer, List<Edge>> G = new HashMap<>();
            for (int i = 0; i < M; i++)
            {
                int from = in.nextInt(), to = in.nextInt(), color = in.nextInt();
                addEdge(from, to, color, G);
            }
            int Q = in.nextInt();

            while (Q-- > 0)
            {
                int from = in.nextInt(), to = in.nextInt();
                int cnt = 0;
                Set<Integer> visited = new HashSet<>();
                for (int C = 1; C <= M; C++)
                {
                    if (visit(G, from, to, C, visited)) cnt++;
                    visited.clear();
                }
                out.println(cnt);
            }
        }

        private boolean visit(Map<Integer, List<Edge>> G, int current, int to, int C, Set<Integer> visited)
        {
            if (visited.contains(current)) return false;
            if (current == to) return true;
            visited.add(current);

            boolean found = false;
            if (G.containsKey(current))
                for (Edge edge : G.get(current))
                {
                    if (edge.color == C)
                    {
                        found |= visit(G, edge.to, to, C, visited);
                    }
                }
            return found;
        }

        private void addEdge(int from, int to, int color, Map<Integer, List<Edge>> G)
        {
            List<Edge> edges = G.getOrDefault(from, new ArrayList<>());
            edges.add(new Edge(to, color));
            G.put(from, edges);

            edges = G.getOrDefault(to, new ArrayList<>());
            edges.add(new Edge(from, color));
            G.put(to, edges);
        }

    }

    static class Edge
    {
        int to;
        int color;

        Edge(int to, int color)
        {
            this.to = to;
            this.color = color;
        }

    }
}

