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;
int n, m, q, ans;
map<int, int> boss[100010];
map<pair<int, int>, int> mp;
vector<pair<int, int> > vt[100010];
int findf(int x, int col) {
  if (!boss[col].count(x) || x == boss[col][x]) {
    boss[col][x] = x;
    return x;
  }
  return boss[col][x] = findf(boss[col][x], col);
}
void dsu(int x, int y, int col) {
  x = findf(x, col);
  y = findf(y, col);
  if (x != y) {
    boss[col][y] = x;
  }
  return;
}
int main() {
  int i, j, a, b, c;
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> a >> b >> c;
    a--, b--, c--;
    dsu(a, b, c);
  }
  for (i = 0; i < m; i++) {
    for (map<int, int>::iterator it = boss[i].begin(); it != boss[i].end();
         it++) {
      a = it->first;
      b = it->second;
      vt[a].push_back(make_pair(i, b));
    }
  }
  for (i = 0; i < n; i++) {
    for (j = 0; j < vt[i].size(); j++) {
      vt[i][j].second = findf(i, vt[i][j].first);
    }
  }
  cin >> q;
  for (i = 0; i < q; i++) {
    cin >> a >> b;
    a--, b--;
    if (vt[a].size() >= vt[b].size()) {
      swap(a, b);
    }
    if (mp.count(make_pair(a, b))) {
      cout << mp[make_pair(a, b)] << endl;
      continue;
    }
    ans = 0;
    for (j = 0; j < vt[a].size(); j++) {
      if (binary_search(vt[b].begin(), vt[b].end(), vt[a][j])) {
        ans++;
      }
    }
    mp[make_pair(a, b)] = ans;
    cout << ans << endl;
  }
  return 0;
}
