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 MAXN = 100011;
struct uf {
  static const int N = 2 * MAXN;
  int p[N], s[N];
  void init() {
    for (int i = 0; i < N; i++) {
      p[i] = i;
      s[i] = 1;
    }
  }
  int findP(int x) {
    if (p[x] == x) return x;
    return p[x] = findP(p[x]);
  }
  bool same(int a, int b) { return findP(a) == findP(b); }
  void join(int a, int b) {
    if (!same(a, b)) {
      a = findP(a);
      b = findP(b);
      if (s[a] < s[b]) swap(a, b);
      p[b] = a;
      s[a] = s[a] + s[b];
    }
  }
};
vector<int> col[MAXN];
pair<pair<int, int>, int> edge[MAXN];
int n, m, q, degsum[MAXN];
uf U;
int getVal(const vector<int>& ar, int idx, int c) {
  return degsum[idx] + lower_bound((ar).begin(), (ar).end(), c) - ar.begin();
}
int main() {
  scanf("%d %d", &n, &m);
  for (int i = 0; i < m; i++) {
    int a, b, c;
    scanf("%d %d %d", &a, &b, &c);
    a--;
    b--;
    c--;
    col[a].push_back((c));
    col[b].push_back((c));
    edge[i] = pair<pair<int, int>, int>(pair<int, int>(a, b), c);
  }
  for (int i = 0; i < n; i++) {
    sort((col[i]).begin(), (col[i]).end());
    col[i].erase(unique((col[i]).begin(), (col[i]).end()), col[i].end());
    degsum[i + 1] = ((int)(col[i]).size()) + degsum[i];
  }
  U.init();
  for (int i = 0; i < m; i++) {
    int a = edge[i].first.first, b = edge[i].first.second, c = edge[i].second;
    int u = getVal(col[a], a, c), v = getVal(col[b], b, c);
    U.join(u, v);
  }
  cin >> q;
  map<pair<int, int>, int> ans;
  while (q--) {
    int u, v, res = 0;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    if (((int)(col[u]).size()) > ((int)(col[v]).size())) swap(u, v);
    pair<int, int> p = pair<int, int>(u, v);
    if (ans.count(p))
      res = ans[p];
    else {
      for (int i = 0; i < ((int)(col[u]).size()); i++) {
        int c = col[u][i], a = degsum[u] + i;
        if (binary_search((col[v]).begin(), (col[v]).end(), c)) {
          int b = getVal(col[v], v, c);
          if (U.same(a, b)) res++;
        }
      }
      ans[p] = res;
    }
    printf("%d\n", res);
  }
  return 0;
}
