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.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

/**
 * Created by Egor on 18/01/15.
 */
public class TaskB {

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter writer;

    public String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }

    public int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    public double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    public static void main(String[] args) throws IOException {
        new TaskB().run();
    }

    public HashSet<Edge>[] graph;
    public int[][] component;

    public void solve() throws IOException {
        int n = nextInt();
        int m = nextInt();
        graph = new HashSet[n];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                graph[i] = new HashSet<>();
            }
        }

        int maxColor = 0;
        for (int i = 0; i < m; i++) {
            int from = nextInt() - 1;
            int to = nextInt() - 1;
            int color = nextInt() - 1;
            graph[from].add(new Edge(to, color));
            graph[to].add(new Edge(from, color));
            maxColor = Math.max(maxColor, color);
        }
        maxColor++;
        component = new int[n][maxColor];

        for (int i = 0; i < n; i++) {
            for (int color = 0; color < maxColor; color++) {
                visited = new boolean[n];
                dfs(i, color);
                currentComp++;
            }
        }

        int q = nextInt();
        StringBuilder builder = new StringBuilder();
        for (int i = 0; i < q; i++) {
            int u = nextInt() - 1;
            int v = nextInt() - 1;
            int answer = 0;
            for (int color = 0; color < maxColor; color++) {
                if (component[u][color] == component[v][color]) {
                    answer++;
                }
            }
            builder.append(answer).append('\n');
        }
        writer.println(builder.toString());
    }

    public boolean[] visited;
    public int currentComp = 0;

    public void dfs(int start, int color) {
        visited[start] = true;
        component[start][color] = currentComp;
        for (Edge e : graph[start]) {
            if (e.color != color) continue;

            if (!visited[e.to]) {
                dfs(e.to, color);
            }
        }
    }

    public void run() {
        try {
            reader = new BufferedReader(new InputStreamReader(System.in));
            writer = new PrintWriter(System.out);

            solve();

            writer.close();
        } catch (IOException e) {
            e.printStackTrace();
            System.exit(1);
        }
    }

}

/*
4 5
1 2 1
1 2 2
2 3 1
2 3 3
2 4 3
3
1 2
3 4
1 4
 */

class Edge {

    public int to;
    public int color;

    public Edge(int to, int color) {
        this.to = to;
        this.color = color;
    }

}