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

public class ID506D {
  static class DSU {
    int[] parent;
    int[] size;

    DSU(int N) {
      parent = new int[N];
      size = new int[N];
      for (int i = 0; i < N; i++) {
        parent[i] = i;
        size[i] = 1;
      }
    }

    int find(int v) {
      if (parent[v] != v)
        parent[v] = find(parent[v]);
      return parent[v];
    }

    void union(int v, int w) {
      v = find(v);
      w = find(w);
      if (v == w)
        return;
      if (size[v] < size[w]) {
        int t = v;
        v = w;
        w = t;
      }
      size[v] += size[w];
      parent[w] = v;
    }
  }

  public static void main(String[] args) throws IOException {
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

    StringTokenizer st = new StringTokenizer(in.readLine());
    int N = Integer.parseInt(st.nextToken());
    int M = Integer.parseInt(st.nextToken());

    DSU[] dsu = new DSU[M];

    for (int i = 0; i < M; i++) {
      dsu[i] = new DSU(N);
    }

    for (int i = 0; i < M; i++) {
      st = new StringTokenizer(in.readLine());
      int v = Integer.parseInt(st.nextToken());
      int w = Integer.parseInt(st.nextToken());
      int c = Integer.parseInt(st.nextToken());
      dsu[c - 1].union(v - 1, w - 1);
    }

    int Q = Integer.parseInt(in.readLine());

    for (int q = 0; q < Q; q++) {
      st = new StringTokenizer(in.readLine());
      int v = Integer.parseInt(st.nextToken());
      int w = Integer.parseInt(st.nextToken());
      int res = 0;
      for (int i = 0; i < M; i++) {
        if (dsu[i].find(v - 1) == dsu[i].find(w - 1))
          res++;
      }
      System.out.println(res);
    }

    in.close();
  }
}