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;
int n, m, q;
unordered_map<int, int> p[100];
unordered_map<int, int> h[100];
unordered_map<int, int> mem[100];
int findSet(int x, int c) {
  return p[x][c] == x ? x : p[x][c] = findSet(p[x][c], c);
}
void mergeSet(int a, int b, int c) {
  int r1 = findSet(a, c), r2 = findSet(b, c);
  if (r1 != r2) {
    if (h[r1][c] < h[r2][c])
      p[r1][c] = r2;
    else if (h[r1][c] > h[r2][c])
      p[r2][c] = r1;
    else
      p[r1][c] = r2, h[r2][c] += 1;
  }
}
bool sameSet(int a, int b, int c) { return findSet(a, c) == findSet(b, c); }
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 -= 1;
    b -= 1;
    if (!p[a].count(c)) p[a][c] = a, h[a][c] = 0;
    if (!p[b].count(c)) p[b][c] = b, h[b][c] = 0;
    mergeSet(a, b, c);
  }
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    u -= 1;
    v -= 1;
    if (p[u].size() > p[v].size()) swap(u, v);
    if (!mem[u].count(v)) {
      int ans = 0;
      for (unordered_map<int, int>::iterator it = p[u].begin();
           it != p[u].end(); it++)
        if (p[v].count(it->first) && sameSet(u, v, it->first)) ans += 1;
      mem[u][v] = ans;
    }
    printf("%d\n", mem[u][v]);
  }
  return 0;
}
