#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100100;
pair<pair<int, int>, int> edges[MAXN];
unordered_set<int> col[MAXN];
unordered_map<int, int> par[MAXN];
unordered_map<long long, int> mp;
int find(int c, int x) {
  if (x == par[c][x]) return x;
  return par[c][x] = find(c, par[c][x]);
}
bool join(int c, int a, int b) {
  a = find(c, a);
  b = find(c, b);
  if (a == b) return false;
  par[c][a] = b;
  return true;
}
bool isconn(int c, int a, int b) { return find(c, a) == find(c, b); }
int main() {
  int N, M;
  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, --c;
    edges[i] = make_pair(make_pair(a, b), c);
    col[a].insert(c);
    col[b].insert(c);
    par[c][a] = a;
    par[c][b] = b;
  }
  for (int i = 0; i < M; ++i) {
    join(edges[i].second, edges[i].first.first, edges[i].first.second);
  }
  int Q;
  scanf("%d", &Q);
  for (int i = 0; i < Q; ++i) {
    int a, b;
    scanf("%d %d", &a, &b);
    --a, --b;
    if (mp.count((long long)MAXN * a + b)) {
      printf("%d\n", mp[(long long)MAXN * a + b]);
      continue;
    }
    int cnt = 0;
    if (col[a].size() > col[b].size()) swap(a, b);
    for (int x : col[a]) {
      if (col[b].count(x)) {
        cnt += isconn(x, a, b);
      }
    }
    mp[(long long)MAXN * a + b] = cnt;
    mp[(long long)MAXN * b + a] = cnt;
    printf("%d\n", cnt);
  }
  return 0;
}
