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.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

/**
 * @author Don Li
 */
public class KitayutaColorfulGraph {

    int n, m;
    List<Edge>[] G;

    boolean[][][] connected;
    boolean[] vis;
    boolean[] mark;

    void solve() {
        n = in.nextInt();
        m = in.nextInt();
        G = new List[n];
        for (int i = 0; i < n; i++) G[i] = new ArrayList<>(4);
        for (int i = 0; i < m; i++) {
            int u = in.nextInt() - 1, v = in.nextInt() - 1, c = in.nextInt() - 1;
            G[u].add(new Edge(u, v, c));
            G[v].add(new Edge(v, u, c));
        }

        connected = new boolean[n][n][m];
        for (int i = 0; i < m; i++) {
            vis = new boolean[n];
            for (int u = 0; u < n; u++) {
                if (!vis[u]) {
                    mark = new boolean[n];
                    dfs(u, i);
                    for (int a = 0; a < n; a++) {
                        for (int b = a + 1; b < n; b++) {
                            if (mark[a] && mark[b]) {
                                connected[a][b][i] = true;
                                connected[b][a][i] = true;
                            }
                        }
                    }
                }
            }
        }

        int q = in.nextInt();
        while (q-- > 0) {
            int u = in.nextInt() - 1, v = in.nextInt() - 1;
            int cnt = 0;
            for (int i = 0; i < m; i++) {
                if (connected[u][v][i]) cnt++;
            }
            out.println(cnt);
        }
    }

    void dfs(int u, int c) {
        vis[u] = true;
        mark[u] = true;
        for (Edge e : G[u]) {
            if (e.color == c && !vis[e.to]) {
                dfs(e.to, c);
            }
        }
    }

    static class Edge {
        int from, to;
        int color;

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

    public static void main(String[] args) {
        in = new FastScanner(new BufferedReader(new InputStreamReader(System.in)));
        out = new PrintWriter(System.out);
        new KitayutaColorfulGraph().solve();
        out.close();
    }

    static FastScanner in;
    static PrintWriter out;

    static class FastScanner {
        BufferedReader in;
        StringTokenizer st;

        public FastScanner(BufferedReader in) {
            this.in = in;
        }

        public String nextToken() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    st = new StringTokenizer(in.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

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

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

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