#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
int kx[] = {2, 2, -2, -2, 1, 1, -1, -1};
int ky[] = {1, -1, 1, -1, 2, -2, 2, -2};
void dance() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void file() {
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
}
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <typename t>
void printV(vector<t> v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << ' ';
  }
  cout << endl;
}
bool isPrime(long long n) {
  if (n == 2) return true;
  if (n < 2 || n % 2 == 0) return false;
  for (long long i = 3; i * i <= n; i += 2)
    if (n % i == 0) return false;
  return true;
}
bool prime[100001];
void seive() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int i = 2; i <= 100000; i++) {
    if (prime[i])
      for (int j = i + i; j <= 100000; j += i) {
        prime[j] = false;
      }
  }
}
long long MOD = 1000000007;
int p[101][101];
int parent(int c, int x) {
  if (p[c][x] == x) return x;
  return p[c][x] = parent(c, p[c][x]);
}
bool sameset(int c, int x, int y) { return (parent(c, x) == parent(c, y)); }
void mer(int c, int x, int y) { p[c][parent(c, x)] = parent(c, y); }
int main() {
  dance();
  int n, m;
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    for (int j = 1; j <= n; j++) p[i][j] = j;
  }
  for (int i = 0; i < m; i++) {
    int a, b, c;
    cin >> a >> b >> c;
    mer(c, a, b);
  }
  int q;
  cin >> q;
  while (q--) {
    int a, b, r = 0;
    cin >> a >> b;
    for (int i = 1; i <= m; i++) r += sameset(i, a, b);
    cout << r << endl;
  }
}
