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;
long long MOD = int(1e9) + 7;
inline int inp() {
  register int n = 0, s = 1, c = getchar();
  if (c == '-') s = -1;
  while (c < 48) c = getchar();
  while (c > 47) n = (n << 3) + (n << 1) + c - '0', c = getchar();
  return n * s;
}
inline void writeInt(long long n) {
  long long N = n, rev, count = 0;
  rev = N;
  if (N == 0) {
    putchar('0');
    putchar('\n');
    return;
  }
  while ((rev % 10) == 0) {
    count++;
    rev /= 10;
  }
  rev = 0;
  while (N != 0) {
    rev = (rev << 3) + (rev << 1) + N % 10;
    N /= 10;
  }
  while (rev != 0) {
    putchar(rev % 10 + '0');
    rev /= 10;
  }
  while (count--) putchar('0');
}
const int N = 1000 * 100 + 5;
const int M = 2 * N;
int debug = 1;
int comp[M];
vector<int> colors[N];
map<pair<int, int>, int> ans;
int findcomp(int u) {
  if (comp[u] == u) return u;
  return comp[u] = findcomp(comp[u]);
}
void merge(int u, int v) { comp[findcomp(u)] = findcomp(v); }
int sumdeg[N];
int getindex(int vertex, int color) {
  return sumdeg[vertex - 1] +
         (lower_bound(colors[vertex].begin(), colors[vertex].end(), color) -
          colors[vertex].begin());
}
pair<pair<int, int>, int> ed[M];
map<pair<int, int>, int> mem;
int main() {
  ios::sync_with_stdio(false);
  int i, j, n, t, m;
  for (i = 0; i < M; i++) comp[i] = i;
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    colors[a].push_back(c);
    colors[b].push_back(c);
    ed[i] = make_pair(make_pair(a, b), c);
  }
  for (i = 1; i <= n; i++) {
    sort(colors[i].begin(), colors[i].end());
    colors[i].erase(unique(colors[i].begin(), colors[i].end()),
                    colors[i].end());
    ;
    sumdeg[i] = sumdeg[i - 1] + colors[i].size();
  }
  for (i = 0; i < m; i++) {
    int a1 = getindex(ed[i].first.first, ed[i].second);
    int b1 = getindex(ed[i].first.second, ed[i].second);
    merge(a1, b1);
  }
  int q;
  cin >> q;
  while (q--) {
    int u, v;
    cin >> u >> v;
    if (make_pair(colors[u].size(), u) > make_pair(colors[v].size(), v))
      swap(u, v);
    pair<int, int> temp = make_pair(u, v);
    if (mem.count(temp))
      cout << mem[temp] << endl;
    else {
      int ans = 0;
      for (i = 0; i < colors[u].size(); i++) {
        int curcolor = colors[u][i];
        if (!binary_search(colors[v].begin(), colors[v].end(), curcolor))
          continue;
        int v1 = getindex(v, curcolor);
        int u1 = getindex(u, curcolor);
        if (findcomp(u1) == findcomp(v1)) ans++;
      }
      mem[temp] = ans;
      cout << ans << endl;
    }
  }
  cin >> i;
}
