Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

#include <bits/stdc++.h>
using namespace std;
int parent[11][1000];
int root[11][1000];
int ans[1000];
int unite(int u, int v, int c);
int rootfind(int a, int c);
int main() {
  int n, m, q, i, j;
  int u, v, c;
  for (i = 0; i < 11; i++) {
    ans[i] = 0;
    for (j = 0; j < 1000; j++) {
      parent[i][j] = 1;
      root[i][j] = 1;
    }
  }
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> u >> v >> c;
    unite(u, v, c);
  }
  cin >> q;
  for (i = 0; i < q; i++) {
    cin >> u >> v;
    for (j = 0; j < 11; j++) {
      if (rootfind(u, j) == rootfind(v, j)) {
        ans[i]++;
      }
    }
  }
  for (i = 0; i < q; i++) {
    cout << ans[i] << endl;
  }
  return 0;
}
int unite(int u, int v, int c) {
  int x, y;
  x = rootfind(u, c);
  y = rootfind(v, c);
  if (x != y) {
    if (parent[c][x] > parent[c][y]) {
      root[c][y] = 0;
      parent[c][x] += parent[c][y];
      parent[c][y] = x;
    } else if (parent[c][x] <= parent[c][y]) {
      root[c][x] = 0;
      parent[c][y] += parent[c][x];
      parent[c][x] = y;
    }
  }
  return 0;
}
int rootfind(int a, int c) {
  int root22 = a, v = a;
  while (root[c][root22] == 0) {
    root22 = parent[c][root22];
  }
  while (root[c][v] == 0) {
    int temp;
    temp = parent[c][v];
    parent[c][v] = root22;
    v = temp;
  }
  if (root22 == 1) root22 = -1;
  return root22;
}
