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 B_MrKitayutasColorfulGraph {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader inp = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Solver solver = new Solver();
        solver.solve(inp, out);
        out.close();
    }

    private static class Solver {
        private void solve(InputReader inp, PrintWriter out) {
            int n = inp.nextInt(), m = inp.nextInt();
            DSU[] dsu = new DSU[m];
            for (int i = 0; i < m; i++) dsu[i] = new DSU(n);
            for (int i = 0; i < m; i++) {
                int u = inp.nextInt() - 1, v = inp.nextInt() - 1, c = inp.nextInt() - 1;
                if (!dsu[c].sameSet(u, v)) dsu[c].union(u, v);
            }
            int q = inp.nextInt();
            for (int i = 0; i < q; i++) {
                int u = inp.nextInt() - 1, v = inp.nextInt() - 1;
                int res = 0;
                for (DSU d: dsu) if (d.sameSet(u, v)) res++;
                out.println(res);
            }
        }

        public class DSU {
            private int[] parents, rank;

            public DSU(int n) {
                parents = new int[n];
                rank = new int[n];
                for (int i = 0; i < n; i++) parents[i] = -1;
            }

            public int findParent(int node) {
                if (parents[node] == -1) return node; //recursively search
                int parent = findParent(parents[node]);
                parents[node] = parent; //don't search another time for parent
                return parent;
            }

            public void union(int x, int y) {
                int xParent = findParent(x), yParent = findParent(y);
                if (rank[x] < rank[y]) parents[xParent] = yParent;
                else if (rank[x] > rank[y]) parents[yParent] = xParent;
                else {
                    parents[yParent] = xParent;
                    rank[xParent]++;
                }
            }

            public boolean sameSet(int x, int y) {
                return findParent(x) == findParent(y);
            }
        }
    }



    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
    }
}