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 sparse_union_find {
  map<int, int> p;
  int find(int x) {
    if (p.find(x) == p.end()) p[x] = x;
    return p[x] == x ? x : p[x] = find(p[x]);
  }
  bool merge(int u, int v) {
    int l1 = find(u), l2 = find(v);
    return l1 == l2 ? false : p[l2] = l1, true;
  }
};
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m;
  cin >> n >> m;
  struct edge {
    int a, b, c;
  };
  vector<edge> e(m);
  vector<vector<int>> g(n);
  vector<sparse_union_find> uf(m);
  for (int i = 0; i < m; i++) {
    cin >> e[i].a >> e[i].b >> e[i].c;
    --e[i].a, --e[i].b, --e[i].c;
    if (uf[e[i].c].merge(e[i].a, e[i].b)) {
      g[e[i].a].push_back(i);
      g[e[i].b].push_back(i);
    }
  }
  vector<vector<int>> comps;
  comps.reserve(m);
  vector<int> id(n);
  int cur_id = 0;
  for (int i = 0; i < m; i++) {
    for (auto &[x, p] : uf[i].p) {
      if (x == p) {
        id[x] = cur_id++;
        comps.emplace_back();
      }
    }
    for (auto &[x, p] : uf[i].p) {
      comps[id[uf[i].find(x)]].push_back(x);
    }
  }
  int q;
  cin >> q;
  vector<map<int, pair<int, vector<int>>>> mp(n);
  for (int i = 0, u, v; i < q; i++) {
    cin >> u >> v, --u, --v;
    if (u > v) swap(u, v);
    mp[u][v].second.push_back(i);
  }
  const int sq = sqrt(n);
  for (auto &comp : comps) {
    if (comp.size() <= sq) {
      for (int u : comp) {
        for (int v : comp) {
          if (u < v) {
            auto it = mp[u].find(v);
            if (it != mp[u].end()) {
              it->second.first += 1;
            }
          }
        }
      }
    } else {
      vector<bool> in_comp(n);
      for (auto u : comp) in_comp[u] = true;
      for (int u = 0; u < n; u++) {
        for (auto &[v, p] : mp[u]) {
          if (in_comp[u] && in_comp[v]) {
            p.first += 1;
          }
        }
      }
    }
  }
  vector<int> ans(q);
  for (int u = 0; u < n; u++) {
    for (auto &[v, p] : mp[u]) {
      for (int i : p.second) {
        ans[i] = p.first;
      }
    }
  }
  for (int i = 0; i < q; i++) cout << ans[i] << '\n';
  return 0;
}
