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 mod = 1e9 + 7;
const int Max = 1e5 + 5;
const long long IFN = 1e18 + 5;
inline void norm(long long &a) {
  a %= mod;
  (a < 0) && (a += mod);
}
inline long long modAdd(long long a, long long b) {
  a %= mod, b %= mod;
  norm(a), norm(b);
  return (a + b) % mod;
}
inline long long modSub(long long a, long long b) {
  a %= mod, b %= mod;
  norm(a), norm(b);
  return (a - b) % mod;
}
inline long long modMul(long long a, long long b) {
  a %= mod, b %= mod;
  norm(a), norm(b);
  return (a * b) % mod;
}
void F_I_O() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
}
long long gcd(long long a, long long b) {
  if (b == 0) {
    return a;
  } else {
    return gcd(b, a % b);
  }
}
bool ok = false;
vector<bool> check(104, false);
vector<int> v[102 + 1];
void dfs(int u) {
  int r = u;
  check[r] = true;
  for (int i = 0; i < v[r].size(); i++) {
    if (check[v[r][i]] == false) {
      dfs(v[r][i]);
    }
  }
}
int main() {
  int t = 1;
  while (t--) {
    int n, m;
    cin >> n >> m;
    vector<int> v1[n + 1];
    int a, b, c;
    for (int j = 0; j < m; j++) {
      cin >> a >> b >> c;
      a--;
      b--;
      v[a].push_back(b);
      v[b].push_back(a);
      bool yes = true;
      for (int i = 0; i < v1[a].size(); i++) {
        if (v1[a][i] == c) {
          yes = false;
        }
      }
      if (yes) {
        v1[a].push_back(c);
      }
      yes = true;
      for (int i = 0; i < v1[b].size(); i++) {
        if (v1[b][i] == c) {
          yes = false;
        }
      }
      if (yes) {
        v1[b].push_back(c);
      }
    }
    int q;
    cin >> q;
    int u, u1;
    for (int i = 0; i < q; i++) {
      cin >> u >> u1;
      u--;
      u1--;
      ok = false;
      for (int j = 0; j < n + 1; j++) {
        check[j] = false;
      }
      dfs(u);
      if (!check[u1]) {
        cout << 0 << '\n';
      } else {
        int ans = 0;
        for (int k = 0; k < v[u].size(); k++) {
          for (int K = 0; K < v[u1].size(); K++) {
            if (v1[u][k] == v1[u1][K]) {
              ans++;
              break;
            }
          }
        }
        cout << ans << '\n';
      }
    }
  }
}
