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;
struct node {
  vector<pair<int, int> > colors;
};
struct grafo {
  node *array;
  int tam;
  grafo(int v) {
    tam = v;
    array = new node[v + 1];
  }
  ~grafo() { delete[] array; }
  void insert_node(int a, int b, int c) {
    array[a].colors.push_back(make_pair(b, c));
    array[b].colors.push_back(make_pair(a, c));
  }
};
void DFS(int start, int fim, bool visited[][101], grafo &x, int color,
         int cont);
bool flag;
int main() {
  int vertices, arestas, a, b, c;
  scanf("%d %d", &vertices, &arestas);
  grafo x(vertices);
  for (int i = 1; i <= arestas; i++) {
    scanf("%d %d %d", &a, &b, &c);
    x.insert_node(a, b, c);
  }
  int consultas, origem, destino;
  bool visited[vertices + 1][101];
  scanf("%d", &consultas);
  for (int i = 0; i < consultas; i++) {
    memset(visited, 0, sizeof(visited));
    scanf("%d %d", &origem, &destino);
    int cont = 0;
    for (int i = 0; i < x.array[origem].colors.size(); i++) {
      flag = false;
      DFS(origem, destino, visited, x, x.array[origem].colors[i].second, 0);
      if (flag) ++cont;
    }
    cout << cont << endl;
  }
}
void DFS(int start, int fim, bool visited[][101], grafo &x, int color,
         int cont) {
  visited[start][color] = true;
  if (start == fim) {
    flag = true;
    return;
  }
  for (int i = 0; i < x.array[start].colors.size(); i++) {
    if (flag) break;
    if (!visited[x.array[start].colors[i].first][color] &&
        x.array[start].colors[i].second == color) {
      DFS(x.array[start].colors[i].first, fim, visited, x, color, cont + 1);
    }
  }
}
