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.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Queue;
import java.util.StringTokenizer;

public class Main {

    public static void main(String args[]) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        SolverB.InputReader in = new SolverB.InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        SolverB solver = new SolverB();
        int testCount = 1;
        for (int i = 1; i <= testCount; i++) {
            solver.solve(in, out);
        }
        out.close();
    }
}

class Graph {
    List<Integer> edges[];
    int n;

    Graph(List<Integer> edges[], int n) {
        this.edges = edges;
        this.n = n;
    }

    public int bfs(final int u, final int v) {
        int visited[] = new int[n+1];

        Queue<Integer> q = new LinkedList<>();
        q.add(u);
        visited[u] = 1;

        while (!q.isEmpty()) {
            int x = q.poll();

            for (int y : edges[x]) {
                if (visited[y] == 0) {
                    q.add(y);
                    visited[y] = 1;
                }
            }
        }

        return visited[v];
    }
}

class SolverB {

    public void solve(InputReader in, PrintWriter out) {

        int n = in.nextInt();
        int m = in.nextInt();

        List<Integer> edges[][] = new ArrayList[m+1][n+1];

        for (int i=1; i<=m; i++) {
            for (int j=1; j<=n; j++) {
                edges[i][j] = new ArrayList<>();
            }
        }

        for (int i=0; i<m; i++) {
            int u = in.nextInt();
            int v = in.nextInt();
            int c = in.nextInt();

            edges[c][u].add(v);
            edges[c][v].add(u);
        }

        Graph graph[] = new Graph[m+1];
        for (int i=1; i<=m; i++) {
            graph[i] = new Graph(edges[i], n);
        }

        int q = in.nextInt();

        for (int i=0; i<q; i++) {
            int u = in.nextInt();
            int v = in.nextInt();

            int s = 0;
            for (int j=1; j<=m; j++) {
                s += graph[j].bfs(u, v);
            }
            out.println(s);
        }

    }

    static class InputReader {
        private final BufferedReader reader;
        private StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream));
        }

        public 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());
        }
    }
}
