Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5


import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class R286D2B {
    private static final String LNSP = System.getProperty("line.separator");
    private static final int INF = (int) (1e9);

    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String line;
        String[] tokens;
        line = br.readLine();
        tokens = line.split(" ");
        int n = Integer.parseInt(tokens[0]);
        int m = Integer.parseInt(tokens[1]);
        int[] a = new int[m];
        int[] b = new int[m];
        int[] c = new int[m];
        for (int i = 0; i < m; i++) {
            line = br.readLine();
            tokens = line.split(" ");
            a[i] = Integer.parseInt(tokens[0]) - 1;
            b[i] = Integer.parseInt(tokens[1]) - 1;
            c[i] = Integer.parseInt(tokens[2]) - 1;
        }
        line = br.readLine();
        tokens = line.split(" ");
        int q = Integer.parseInt(tokens[0]);
        int[] u = new int[q];
        int[] v = new int[q];
        for (int i = 0; i < q; i++) {
            line = br.readLine();
            tokens = line.split(" ");
            u[i] = Integer.parseInt(tokens[0]) - 1;
            v[i] = Integer.parseInt(tokens[1]) - 1;
        }

        int[] ret = new int[q];
        for (int j = 0; j < m; j++) {   // for each color
            int[][] dist = getDistanceMatrix(n);
            for (int i = 0; i < m; i++) {
                if (c[i] == j) {
                    dist[a[i]][b[i]] = 1;
                    dist[b[i]][a[i]] = 1;
                }
            }
            warshallFloyd(dist);
            for (int i = 0; i < q; i++) {   // for each q
                if (dist[u[i]][v[i]] != INF) {
                    ++ret[i];
                }
            }
        }
        System.out.println(Arrays.toString(ret).replaceAll("[\\[\\]]", "").replaceAll(", ", LNSP));
    }

    private static void warshallFloyd(int[][] dist) {
        int n = dist.length;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                for (int k = 0; k < n; k++)
                    dist[i][j] = Math.min(dist[i][j], dist[i][k] + dist[k][j]);
    }

    private static int[][] getDistanceMatrix(int n) {
        int[][] ret = new int[n][n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                ret[i][j] = INF;
            }
        }
        return ret;
    }

}
