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;
using ll = long long;
constexpr int kMaxN = 1e5 + 7;
constexpr int kSq = 350;
vector<array<int, 2>> c_edges[kMaxN];
int p[kMaxN];
int find(int x) {
  if (x == p[x]) {
    return x;
  }
  return p[x] = find(p[x]);
}
void unite(int x, int y) { p[find(x)] = find(y); }
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  unordered_map<int, unordered_map<int, int>> counts;
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= n; ++i) {
    p[i] = i;
  }
  for (int i = 0; i < m; ++i) {
    int a, b, c;
    cin >> a >> b >> c;
    c_edges[c].push_back({a, b});
  }
  int q;
  cin >> q;
  vector<array<int, 2>> queries;
  queries.reserve(q);
  for (int i = 0; i < q; ++i) {
    int u, v;
    cin >> u >> v;
    if (u > v) {
      swap(u, v);
    }
    queries.push_back({u, v});
  }
  for (int c = 1; c <= m; ++c) {
    if (c_edges[c].empty()) {
      continue;
    }
    if (c_edges[c].size() <= kSq) {
      vector<int> nodes;
      for (auto &e : c_edges[c]) {
        unite(e[0], e[1]);
        nodes.emplace_back(e[0]);
        nodes.emplace_back(e[1]);
      }
      sort(nodes.begin(), nodes.end());
      nodes.resize(unique(nodes.begin(), nodes.end()) - nodes.begin());
      for (int i = 0; i < nodes.size(); ++i) {
        for (int j = i + 1; j < nodes.size(); ++j) {
          if (find(nodes[i]) == find(nodes[j])) {
            ++counts[nodes[i]][nodes[j]];
          }
        }
      }
      for (int u : nodes) {
        p[u] = u;
      }
      continue;
    }
    for (auto &e : c_edges[c]) {
      unite(e[0], e[1]);
    }
    unordered_map<int, unordered_set<int>> used;
    for (auto &query : queries) {
      if (find(query[0]) == find(query[1]) && !used[query[0]].count(query[1])) {
        used[query[0]].emplace(query[1]);
        ++counts[query[0]][query[1]];
      }
    }
    for (int i = 1; i <= n; ++i) {
      p[i] = i;
    }
  }
  for (auto &query : queries) {
    cout << counts[query[0]][query[1]] << '\n';
  }
  return 0;
}
