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.math.BigDecimal;
import java.math.MathContext;
import java.util.*;

import static java.lang.System.out;

public class Main {

    Scanner scanner = new Scanner(System.in);

    public static void main(String[] args) {
        new Main().solve();
    }

    int p[][];
    int size[][];


    void make(int v, int c) {
        p[c][v] = v;
        size[c][v] = 1;
    }

    int find(int v, int c) {
        if (v == p[c][v]) {
            return v;
        }
        return p[c][v] = find(p[c][v], c);
    }

    void union(int a, int b, int c) {
        a = find(a, c);
        b = find(b, c);
        if (a != b) {
            if (size[c][a] < size[c][b]) {
                int t = b;
                b = a;
                a = t;
            }

            p[c][b] = a;
            size[c][a] += size[c][b];
        }
    }

    void solve() {
        int n = scanner.nextInt(), m = scanner.nextInt();
        p = new int[m][n];
        size = new int[m][n];

        for (int i = 0 ; i < n; i++) {
            for (int j = 0; j < m; j++) {
                make(i, j);
            }
        }
        for (int i = 0 ; i < m; i++) {
            int u = scanner.nextInt() - 1, v = scanner.nextInt() - 1, c = scanner.nextInt() - 1;
            union(u, v, c);
        }

        int q = scanner.nextInt();

        for (int i = 0; i < q; i++) {
            int u = scanner.nextInt() - 1, v = scanner.nextInt() - 1;
            int ans = 0;
            for (int j = 0; j < m; j++) {
                int a = find(u, j);
                int b = find(v, j);
                if (a == b) {
                    ans ++;
                }
            }
            out.println(ans);
        }
    }

    class FastScanner {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        public FastScanner() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }
        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
        public String nextLine() {
            try {
                return reader.readLine();
            } catch(IOException e) {
                throw new RuntimeException(e);
            }
        }
    }
}