Mr. Kitayuta has just bought an undirected graph consisting of 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 ≤ 100, 1 ≤ m ≤ 100), 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 ≤ 100), 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. 
2 1
1 2 1
1
1 2
 2 3
1 2 3
1 2 2
1 2 1
1
1 2
 2 5
1 2 1
1 2 2
1 2 3
1 2 4
1 2 5
1
1 2

1
 3
 5

#include <bits/stdc++.h>
using namespace std;
struct arista {
  int punta;
  int color;
};
int n, m;
vector<vector<arista> > G;
map<pair<int, int>, int> rep;
vector<bool> vis;
vector<unordered_set<int> > colores;
void llena(int v) {
  if (vis[v]) return;
  vis[v] = true;
  for (auto adj : G[v]) {
    int col = adj.color;
    int vrt = adj.punta;
    if (vis[vrt]) continue;
    rep[{vrt, col}] = rep[{v, col}];
  }
  for (auto adj : G[v]) llena(adj.punta);
}
int query(int u, int v) {
  if (colores[u].size() > colores[v].size()) swap(u, v);
  int ans = 0;
  for (auto col : colores[u]) {
    if (rep.find({v, col}) != rep.end() and rep[{u, col}] == rep[{v, col}])
      ++ans;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m;
  colores = vector<unordered_set<int> >(n, unordered_set<int>());
  vis = vector<bool>(n, false);
  G = vector<vector<arista> >(n, vector<arista>());
  for (int i = 0; i < m; ++i) {
    int u, v, c;
    cin >> u >> v >> c;
    --u, --v;
    colores[u].insert(c);
    colores[v].insert(c);
    G[u].push_back({v, c});
    G[v].push_back({u, c});
    rep[{u, c}] = u;
    rep[{v, c}] = v;
  }
  for (int i = 0; i < n; ++i)
    if (not vis[i]) llena(i);
  int q;
  cin >> q;
  for (int i = 0; i < q; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    cout << query(u, v) << "\n";
  }
}
