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;
vector<int> arr[100][100];
bool colored_dfs(int u, int v, int c, vector<vector<int> > &adj,
                 vector<bool> &visited) {
  bool success = false;
  if (u == v) return true;
  for (int n : adj[u]) {
    for (int color : arr[u][n]) {
      if ((color == c) && (!visited[n])) {
        visited[n] = true;
        success = colored_dfs(n, v, c, adj, visited);
        if (success) return true;
      }
    }
  }
  return success;
}
int dfs(int u, int v, vector<vector<int> > &adj) {
  int ans = 0;
  vector<bool> visited;
  vector<bool> color_used(101, false);
  for (int n : adj[u]) {
    for (int c : arr[u][n]) {
      if (color_used[c]) continue;
      color_used[c] = true;
      visited.resize(adj.size());
      visited[u] = true;
      visited[n] = true;
      if (colored_dfs(n, v, c, adj, visited)) {
        ans++;
      }
      visited.clear();
    }
  }
  return ans;
}
int main() {
  int n, m;
  cin >> n >> m;
  vector<vector<int> > adj(n, vector<int>());
  int a, b, c;
  for (int i = 0; i < m; i++) {
    cin >> a >> b >> c;
    a--;
    b--;
    arr[a][b].push_back(c);
    arr[b][a].push_back(c);
    int flag = 0;
    for (int i : adj[a]) {
      if (i == b) {
        flag = 1;
        break;
      }
    }
    if (flag) continue;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  int q;
  cin >> q;
  vector<int> ans(q, 0);
  for (int i = 0; i < q; i++) {
    cin >> a >> b;
    a--;
    b--;
    ans[i] = dfs(a, b, adj);
  }
  for (int i : ans) cout << i << endl;
}
