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;
#pragma warning(disable : 4996)
int N, M;
unordered_map<int, unordered_set<long long>> edges;
unordered_map<long long, long long> belongs;
long long getBel(long long v, bool ins = false, bool fin = false) {
  auto it = belongs.find(v);
  if (it == belongs.end()) {
    if (ins) belongs.insert(pair<long long, long long>(v, -v));
    return v;
  }
  if (it->second < 0) return fin ? it->second : v;
  return belongs[v] = getBel(it->second, ins, fin);
}
int main() {
  while (scanf("%d %d", &N, &M) != EOF) {
    int a, b, col;
    belongs.clear();
    edges.clear();
    for (int i = int(0); i < int(M); i++) {
      scanf("%d %d %d", &a, &b, &col);
      edges[a].insert(col);
      edges[b].insert(col);
      long long s1 = getBel(col * 1000000LL + a, true),
                s2 = getBel(col * 1000000LL + b, true);
      if (s1 != s2) {
        belongs[s1] = s2;
      }
    }
    int Q, u, v;
    scanf("%d", &Q);
    unordered_map<long long, int> ans;
    for (int i = int(1); i < int(N + 1); i++) {
      unordered_set<long long> ss;
      auto &c = edges[i];
      for (decltype((c).begin()) it = (c).begin(); it != (c).end(); it++) {
        ss.insert(getBel(*it * 1000000LL + i, false, true));
      }
      c = ss;
    }
    for (int i = int(0); i < int(Q); i++) {
      scanf("%d %d", &u, &v);
      if (edges[u].size() > edges[v].size()) swap(u, v);
      auto itAns = ans.find(u * 1000000LL + v);
      if (itAns != ans.end()) {
        printf("%d\n", itAns->second);
      } else {
        int tans = 0;
        auto &c1 = edges[u], &c2 = edges[v];
        for (decltype((c1).begin()) it = (c1).begin(); it != (c1).end(); it++) {
          tans += c2.find(*it) != c2.end();
        }
        ans[u * 1000000LL + v] = tans;
        printf("%d\n", tans);
      }
    }
  }
  return 0;
}
