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;
const int N = 100010;
int n, m;
vector<pair<int, int> > g[N];
int par[N];
vector<int> temp[N];
bool used[N];
vector<vector<int> > comp;
vector<int> big;
int bid[N];
vector<int> app[N];
int cnt[500][N];
inline int find(int i) { return par[i] == i ? i : par[i] = find(par[i]); }
void init() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    a--;
    b--;
    g[c].push_back(make_pair(a, b));
  }
  return;
}
void slove() {
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < g[i].size(); j++) {
      int a = g[i][j].first, b = g[i][j].second;
      par[a] = a;
      par[b] = b;
    }
    memset(used, 0, sizeof(used));
    for (int j = 0; j < g[i].size(); j++) {
      int a = g[i][j].first, b = g[i][j].second;
      par[find(a)] = find(b);
    }
    for (int j = 0; j < g[i].size(); j++) {
      int a = g[i][j].first, b = g[i][j].second;
      if (!used[a]) {
        used[a] = 1;
        temp[find(a)].push_back(a);
      }
      if (!used[b]) {
        used[b] = 1;
        temp[find(b)].push_back(b);
      }
    }
    for (int j = 0; j < g[i].size(); j++) {
      int a = g[i][j].first, b = g[i][j].second;
      if (find(a) == a) {
        comp.push_back(temp[a]);
        temp[a].clear();
      }
      if (find(b) == b) {
        comp.push_back(temp[b]);
        temp[b].clear();
      }
    }
  }
  for (int i = 0; i < comp.size(); i++)
    for (int j = 0; j < comp[i].size(); j++) app[comp[i][j]].push_back(i);
  for (int i = 0; i < n; i++)
    if (app[i].size() > 450) {
      big.push_back(i);
      bid[i] = big.size();
    } else
      bid[i] = -1;
  for (int i = 0; i < big.size(); i++) {
    int x = big[i];
    for (int j = 0; j < app[x].size(); j++) {
      int y = app[x][j];
      for (int k = 0; k < comp[y].size(); k++) cnt[x][comp[y][k]]++;
    }
  }
  return;
}
void out() {
  int q;
  scanf("%d", &q);
  while (q--) {
    int u, v;
    scanf("%d%d", &u, &v);
    u--;
    v--;
    if (bid[u] == -1) swap(u, v);
    if (bid[u] != -1)
      printf("%d\n", cnt[u][v]);
    else {
      int curu = 0, curv = 0, ans = 0;
      while (curu < app[u].size() && curv < app[v].size())
        if (app[u][curu] == app[v][curv]) {
          ans++;
          curu++;
          curv++;
        } else if (app[u][curu] < app[v][curv])
          curu++;
        else
          curv++;
      printf("%d\n", ans);
    }
  }
  return;
}
int main() {
  init();
  slove();
  out();
  return 0;
}
