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;
const long long N = 120;
vector<vector<long long> > g;
vector<bool> vis;
vector<long long> clr[N][N];
set<long long> s;
void print(vector<long long> &v) {
  for (auto &x : v) cout << x << " ";
  cout << endl;
  return;
}
vector<long long> intersect(vector<long long> x, vector<long long> y) {
  vector<long long> v;
  for (auto xx : x) {
    for (auto yy : y)
      if (xx == yy) v.push_back(xx);
  }
  return v;
}
void dfs(long long u, long long v, vector<long long> options) {
  if (u == v) {
    for (auto x : options) s.insert(x);
    return;
  }
  if (vis[u]) return;
  vis[u] = true;
  for (auto node : g[u]) {
    if (!vis[node]) dfs(node, v, intersect(options, clr[u][node]));
  }
  return;
}
int32_t main() {
  long long t = 1;
  while (t--) {
    long long n, m, c = 0;
    cin >> n >> m;
    g.clear();
    g.resize(n);
    vis.clear();
    vis.resize(n, false);
    for (long long i = 0; i < m; i++) {
      long long u, v, cl;
      cin >> u >> v >> cl;
      u--, v--;
      c = max(c, cl);
      g[u].push_back(v), g[v].push_back(u);
      clr[u][v].push_back(cl), clr[v][u].push_back(cl);
    }
    long long q;
    cin >> q;
    while (q--) {
      long long u, v;
      cin >> u >> v;
      u--, v--;
      s.clear();
      vector<long long> options(c);
      for (long long i = 0; i < c; i++) options[i] = i + 1;
      dfs(u, v, options);
      cout << s.size() << endl;
    }
  }
  return 0;
}
