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;
template <typename T>
void print(const vector<vector<T>>& m) {
  for (const auto& r : m) {
    for (const auto& c : r) cout << c << ' ';
    cout << endl;
  }
  cout << endl;
}
template <typename T>
void print(const vector<T>& v) {
  for (const auto& c : v) cout << c << ' ';
  cout << endl;
}
struct helper {
  bool operator()(const pair<int, int>& p1, const pair<int, int>& p2) const {
    return p1.first < p2.first;
  }
};
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<pair<int, int>>> graph(n, vector<pair<int, int>>(n));
  unordered_set<int> colors;
  for (int i = 0; i < m; i++) {
    int v1, v2, c;
    cin >> v1 >> v2 >> c;
    --v1;
    --v2;
    graph[v1].push_back(make_pair(v2, c));
    graph[v2].push_back(make_pair(v1, c));
    colors.insert(c);
  }
  int q;
  cin >> q;
  vector<pair<int, int>> queries(q);
  for (int i = 0; i < q; i++) cin >> queries[i].first >> queries[i].second;
  vector<int> res(q);
  for (auto color : colors) {
    vector<int> components(n, -1);
    for (int s = 0; s < n; s++) {
      if (components[s] != -1) continue;
      queue<int> q;
      q.push(s);
      while (!q.empty()) {
        auto v = q.front();
        q.pop();
        if (components[v] != -1) continue;
        components[v] = s;
        for (const auto& e : graph[v]) {
          if (components[e.first] == -1 && e.second == color) {
            q.push(e.first);
          }
        }
      }
    }
    for (int i = 0; i < q; i++) {
      if (components[queries[i].first - 1] == components[queries[i].second - 1])
        res[i]++;
    }
  }
  for (auto n : res) cout << n << endl;
  return 0;
}
