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 const MN = 1e5 + 100, MS = 333;
int n, m, tq, SQ, bg;
int dsu[MS][MN];
vector<int> c[MN];
vector<pair<int, int> > e[MN];
unordered_map<int, int> cnt[MN];
int find(int r, int v) {
  if (dsu[r][v] < 0) return v;
  return dsu[r][v] = find(r, dsu[r][v]);
}
void merge(int r, int u, int v) {
  u = find(r, u);
  v = find(r, v);
  if (u == v) return;
  if (-dsu[r][u] > -dsu[r][v]) swap(u, v);
  dsu[r][v] += dsu[r][u];
  dsu[r][u] = v;
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  memset(dsu, -1, sizeof(dsu));
  cin >> n >> m;
  SQ = ceil(sqrt(m));
  for (int i = 0, u, v, r; i < m; i++) {
    cin >> u >> v >> r;
    u--, v--;
    r--;
    c[r].push_back(u);
    c[r].push_back(v);
    e[r].push_back({u, v});
  }
  for (int i = 0; i < m; i++) {
    sort(c[i].begin(), c[i].end());
    c[i].resize(unique(c[i].begin(), c[i].end()) - c[i].begin());
  }
  for (int i = 0; i < m; i++) {
    int r = (c[i].size() > SQ ? ++bg : 0);
    for (pair<int, int> ed : e[i]) merge(r, ed.first, ed.second);
    if (!r) {
      for (int v : c[i]) {
        for (int u : c[i]) {
          if (u >= v) break;
          if (find(r, u) == find(r, v)) cnt[u][v]++;
        }
      }
      for (int v : c[i]) dsu[r][v] = -1;
    }
  }
  cin >> tq;
  while (tq--) {
    int u, v, res = 0;
    cin >> u >> v;
    u--, v--;
    if (u > v) swap(u, v);
    if (cnt[u].find(v) != cnt[u].end()) res = cnt[u][v];
    for (int i = 1; i <= bg; i++)
      if (find(i, u) == find(i, v)) res++;
    cout << res << '\n';
  }
}
