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;
unordered_set<int> cc[100100];
unordered_map<int, int> f[100100];
map<pair<int, int>, int> ans;
int getf(int cur, int color) {
  if (f[cur].find(color) == f[cur].end())
    return cur;
  else
    return f[cur][color] = getf(f[cur][color], color);
}
void join(int a, int b, int color) {
  int fa = getf(a, color), fb = getf(b, color);
  if (fa != fb) f[fa][color] = fb;
}
int solve(int a, int b) {
  int RES = 0;
  for (unordered_set<int>::iterator it = cc[a].begin(); it != cc[a].end(); it++)
    if (getf(a, *it) == getf(b, *it)) RES++;
  return RES;
}
int main() {
  int N, M, Q, i, a, b, c, u, v;
  scanf("%d %d", &N, &M);
  for (i = 0; i < M; i++) {
    scanf("%d %d %d", &a, &b, &c);
    cc[a].insert(c);
    cc[b].insert(c);
    join(a, b, c);
  }
  scanf("%d", &Q);
  for (i = 0; i < Q; i++) {
    scanf("%d %d", &u, &v);
    if (cc[u].size() < cc[v].size()) {
      a = u;
      b = v;
    } else {
      a = v;
      b = u;
    }
    if (ans.find(make_pair(a, b)) == ans.end())
      ans[make_pair(a, b)] = solve(a, b);
    printf("%d\n", ans[make_pair(a, b)]);
  }
  return 0;
}
