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. 
#include <bits/stdc++.h>
using namespace std;
struct vertex {
  int id, color;
};
vector<vector<vertex>> ADJLST;
vector<vector<int>> COLORS;
void init(int N) {
  ADJLST.resize(N + 1);
  COLORS.resize(N + 1, vector<int>(N + 1, 0));
}
int DFS(vector<int> Visited, unordered_set<int> &SET, int target, int index,
        int color = -1) {
  if (index == target) {
    if (SET.find(color) == SET.end()) {
      SET.insert(color);
      return 1;
    } else
      return 0;
  } else {
    Visited[index] = true;
    int total = 0;
    for (int i = 0; i < ADJLST[index].size(); i++) {
      vertex adjc = ADJLST[index][i];
      if (!Visited[adjc.id]) {
        if (color == -1 || color == adjc.color) {
          total += DFS(Visited, SET, target, adjc.id, adjc.color);
        }
      }
    }
    return total;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  init(n);
  while (m--) {
    int a, b, c;
    cin >> a >> b >> c;
    ADJLST[a].push_back({b, c});
    ADJLST[b].push_back({a, c});
  }
  vector<int> Visited(n + 1, false);
  unordered_set<int> color;
  int q;
  cin >> q;
  for (int i = 1; i <= n; i++) {
    for (int j = i + 1; j <= n; j++) {
      unordered_set<int> SET;
      COLORS[i][j] = DFS(Visited, SET, j, i);
      COLORS[j][i] = COLORS[i][j];
    }
  }
  while (q--) {
    int a, b;
    cin >> a >> b;
    cout << COLORS[a][b] << '\n';
  }
}
