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.InputStreamReader;
import java.util.Arrays;

public class KitayutasColorfulGraph {
    static Edge graph[][] = new Edge[100][100];
    static boolean visited[] = new boolean[100];
    static int n, m, currDest;
    static boolean found;

    static class Edge {
        boolean colors[];

        Edge(int m) {
            colors = new boolean[m];
        }
    }

    public static void main(String[] args) throws Exception {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        String[] l = bf.readLine().split(" ");
        n = Integer.parseInt(l[0]);
        m = Integer.parseInt(l[1]);
        int a, b, c;
        for (int i = 0; i < m; i++) {
            l = bf.readLine().split(" ");
            a = Integer.parseInt(l[0]) - 1;
            b = Integer.parseInt(l[1]) - 1;
            c = Integer.parseInt(l[2]) - 1;
            if (graph[a][b] == null)
                graph[a][b] = new Edge(m);
            if (graph[b][a] == null)
                graph[b][a] = new Edge(m);
            graph[a][b].colors[c] = true;
            graph[b][a].colors[c] = true;
        }
        int q = Integer.parseInt(bf.readLine());
        int ans;
        StringBuffer sb = new StringBuffer();
        for (int i = 0; i < q; i++) {
            l = bf.readLine().split(" ");
            a = Integer.parseInt(l[0]) - 1;
            currDest = Integer.parseInt(l[1]) - 1;
            ans = 0;
            for (int color = 0; color < m; color++) {
                Arrays.fill(visited, false);
                if (dfs(a, color))
                    ans++;
            }
            sb.append(ans + "\n");
        }
        System.out.print(sb);
    }

    static boolean dfs(int u, int c) {
        visited[u] = true;
        if (u == currDest) {
            return true;
        }
        for (int v = 0; v < n; v++) {
            if (!visited[v] && graph[u][v] != null && graph[u][v].colors[c])
                if (dfs(v, c))
                    return true;
        }
        return false;
    }
}
