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;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5 + 10;
vector<pair<int, int> > g[MAXN];
int n;
vector<int> p[MAXN];
int cnt = 0;
vector<int> belong[MAXN];
vector<int> fa[MAXN];
vector<vector<int> > v[MAXN];
int f(int i, int j) {
  if (fa[i][j] == j) return j;
  return fa[i][j] = f(i, fa[i][j]);
}
map<pair<int, int>, int> M;
int main() {
  ios::sync_with_stdio(false);
  cin >> n;
  int m;
  cin >> m;
  for (int i = 1; i <= m; ++i) {
    int u, v;
    cin >> u >> v;
    int c;
    cin >> c;
    p[c].push_back(u);
    p[c].push_back(v);
    g[c].push_back(make_pair(u, v));
  }
  for (int i = 1; i <= m; ++i) {
    sort(p[i].begin(), p[i].end());
    p[i].erase(unique(p[i].begin(), p[i].end()), p[i].end());
    for (int j = 0; j < p[i].size(); ++j) {
      fa[i].push_back(j);
      v[i].push_back(vector<int>(0));
      v[i][j].push_back(p[i][j]);
    }
    for (auto it : g[i]) {
      int u, v_;
      u = it.first;
      v_ = it.second;
      u = lower_bound(p[i].begin(), p[i].end(), u) - p[i].begin();
      v_ = lower_bound(p[i].begin(), p[i].end(), v_) - p[i].begin();
      if (f(i, u) != f(i, v_)) {
        int U, V;
        U = fa[i][u];
        V = fa[i][v_];
        if (v[i][U].size() < v[i][V].size()) {
          for (auto it : v[i][U]) {
            v[i][V].push_back(it);
          }
        } else {
          for (auto it : v[i][V]) {
            v[i][U].push_back(it);
          }
          v[i][V] = v[i][U];
        }
        v[i][U].clear();
        fa[i][f(i, u)] = f(i, v_);
      }
    }
    for (int j = 0; j < p[i].size(); ++j) {
      if (f(i, j) == j) {
        cnt++;
        for (auto it : v[i][j]) {
          belong[it].push_back(cnt);
        }
      }
    }
    v[i].clear();
  }
  for (int i = 1; i <= n; ++i) sort(belong[i].begin(), belong[i].end());
  int q;
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    int u, v;
    cin >> u >> v;
    if (u > v) swap(u, v);
    if (M.find(make_pair(u, v)) != M.end()) {
      cout << M[make_pair(u, v)] << endl;
      continue;
    }
    int res = 0;
    if (belong[u].size() > belong[v].size()) {
      for (auto it : belong[v]) {
        res += binary_search(belong[u].begin(), belong[u].end(), it);
      }
    } else {
      for (auto it : belong[u]) {
        res += binary_search(belong[v].begin(), belong[v].end(), it);
      }
    }
    cout << (M[make_pair(u, v)] = res) << endl;
  }
  return 0;
}
