#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
vector<int> ed[105], c[105];
int n, m, u, v, co, q, res = 0, bl[105];
set<int> s;
void dfs(int p, int x) {
  if (p == v) {
    s.insert(x);
    return;
  }
  if (bl[p] != 0) return;
  bl[p] = 1;
  for (int i = 0; i < ed[p].size(); i++) {
    if (x == 0) {
      dfs(ed[p][i], c[p][i]);
    } else {
      if (c[p][i] == x) {
        dfs(ed[p][i], c[p][i]);
      }
    }
  }
  bl[p] = 0;
  return;
}
int main() {
  scanf("%d %d", &n, &m);
  for (__typeof(m) i = (1); i <= (m); i++) {
    scanf("%d %d", &u, &v);
    scanf("%d", &co);
    ed[u].push_back(v);
    ed[v].push_back(u);
    c[u].push_back(co);
    c[v].push_back(co);
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d %d", &u, &v);
    dfs(u, 0);
    printf("%d", (int)s.size());
    if (q > 0) printf("\n");
    s.clear();
  }
  for (__typeof(101) i = (0); i <= (101); i++) {
    ed[i].clear();
    c[i].clear();
  }
  return 0;
}
