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. 
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class Solution_505B {
    public static boolean[][][] colorMatrix;
    public static boolean[] used;

    public static void main(String[] args) throws Exception {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        String strings[] = reader.readLine().split(" ");
        int nodes = Integer.parseInt(strings[0]);   //количество вершин графа
        int edges = Integer.parseInt(strings[1]);   // количество ребер графа

         colorMatrix = new boolean[edges + 1][nodes + 1][nodes + 1];
         used = new boolean[nodes + 1];

        for (int i = 1; i <= edges; i++) {
            String edge[] = reader.readLine().split(" ");
            int apex1 = Integer.parseInt(edge[0]);
            int apex2 = Integer.parseInt(edge[1]);
            int color = Integer.parseInt(edge[2]);

            colorMatrix[color][apex1][apex2] = true;
            colorMatrix[color][apex2][apex1] = true;
        }

        int requests = Integer.parseInt(reader.readLine());
        for (int i = 0; i < requests; i++) {
            String edge[] = reader.readLine().split(" ");
            int apex1 = Integer.parseInt(edge[0]);
            int apex2 = Integer.parseInt(edge[1]);
            int num = 0;

            for (int j = 1; j <= edges; j++) {
                used = new boolean[nodes + 1];
                DFS(j, apex1, nodes);
                if (used[apex2])
                    num++;
            }

            System.out.println(num);
        }
    }

    public static void DFS(int color, int v, int nodes) {
        used[v] = true; // помечаем вершину
        for (int nv = 1; nv <= nodes; nv++) // перебираем вершины
            if (!used[nv] && colorMatrix[color][v][nv]) // если вершина не помечена, и смежна с текущей
                DFS(color, nv, nodes); // рекурсивно запускаем от нее DFS
    }

}

