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;
map<int, map<int, vector<int>>> m;
bool bb = false;
void find(int j, int f, int s, vector<bool> &c) {
  if (m.count(j) == 0) return;
  if (m[j].count(f) == 0) return;
  if (f == s) {
    bb = true;
    return;
  }
  int i;
  c[f - 1] = true;
  for (i = 0; i < m[j][f].size(); i++) {
    if (!c[m[j][f][i] - 1]) find(j, m[j][f][i], s, c);
  }
}
int main() {
  int n, k;
  cin >> n >> k;
  int i, j;
  int f, s, t;
  for (i = 0; i < k; i++) {
    cin >> f >> s >> t;
    m[t][f].push_back(s);
    m[t][s].push_back(f);
  }
  cin >> t;
  int cc, jj;
  int nn = 0;
  int p;
  vector<bool> c;
  for (i = 0; i < t; i++) {
    cin >> f >> s;
    cc = 0;
    for (j = 1; j <= k; j++) {
      bb = false;
      c.clear();
      for (p = 0; p < n; p++) c.push_back(false);
      find(j, f, s, c);
      if (bb) cc++;
    }
    cout << cc << "\n";
  }
  return 0;
}
