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;
namespace Debug {
template <typename Ty>
inline void _debug(const char* f, Ty t) {
  cerr << f << '=' << t << endl;
}
template <typename Ty, typename... Ar>
inline void _debug(const char* f, Ty x, Ar... y) {
  while (*f != ',') cerr << *f++;
  cerr << '=' << x << ",";
  _debug(f + 1, y...);
}
template <typename Ty>
ostream& operator<<(ostream& os, const vector<Ty>& V) {
  os << "[";
  for (const auto& vv : V) os << vv << ",";
  os << "]";
  return os;
}
}  // namespace Debug
using namespace Debug;
namespace FastIO {
template <typename Ty>
inline void read(Ty& x) {
  char c;
  int f = 1;
  x = 0;
  while (!isdigit(c = getchar())) f = c ^ '-' ? 1 : -1;
  while (x = (x << 3) + (x << 1) + (c & 15), isdigit(c = getchar()))
    ;
  x *= f;
}
template <typename Ty, typename... Ar>
inline void read(Ty& x, Ar&... y) {
  read(x), read(y...);
}
template <typename Ty>
inline void write(Ty x) {
  x < 0 && (putchar(('-')), x = -x, 0),
      x < 10 ? (putchar((x + '0')), 0)
             : (write(x / 10), putchar((x % 10 + '0')), 0);
}
template <typename Ty>
inline void writeln(const Ty& x) {
  write(x), putchar(('\n'));
}
}  // namespace FastIO
using namespace FastIO;
const int N = 1e5 + 10;
int n, m, q;
unordered_map<int, int> F[N], Ans[N], v[N];
inline int Find(const int& k, const int& x) {
  return (!F[k].count(x) || F[k][x] == x) ? x : F[k][x] = Find(k, F[k][x]);
}
inline void Merge(const int& k, register int x, register int y) {
  (x = Find(k, x)) ^ (y = Find(k, y)) && (F[k][x] = y);
}
inline int Q(const int& x, const int& y) {
  register int S = 0;
  for (auto i : v[x])
    S += (v[y].count(i.first) && Find(i.first, x) == Find(i.first, y));
  return S;
}
int main() {
  register int i, x, y, z;
  for (read(n, m), i = 1; i <= m; i++)
    read(x, y, z), Merge(z, x, y), v[x][z] = v[y][z] = 1;
  read(q);
  while (q--)
    read(x, y), v[x].size() > v[y].size() && (swap(x, y), 0),
        Ans[x].count(y) ? writeln(Ans[x][y]) : writeln(Ans[x][y] = Q(x, y));
  return 0;
}
