#include <bits/stdc++.h>
using namespace std;
int n, m, q, ccnt[100005], fth[100005 << 1];
vector<int> colo[100005];
pair<pair<int, int>, int> info[100005];
int rarg(vector<int> &a) {
  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  return a.size();
}
int find(int a, int c) {
  return ccnt[a - 1] + lower_bound(colo[a].begin(), colo[a].end(), c) -
         colo[a].begin();
}
void init() {
  for (int i = 0; i < ccnt[n]; ++i) fth[i] = i;
}
int getf(int a) { return fth[a] == a ? a : (fth[a] = getf(fth[a])); }
void merge(int A, int B) { fth[getf(A)] = getf(B); }
map<pair<int, int>, int> memo;
int ccount(int a, int b) {
  int ans = 0, l = colo[a].size();
  for (int i = 0; i < l; ++i) {
    int c = colo[a][i];
    if (binary_search(colo[b].begin(), colo[b].end(), c) &&
        getf(find(a, c)) == getf(find(b, c)))
      ans++;
  }
  memo[make_pair(a, b)] = ans;
  memo[make_pair(b, a)] = ans;
  return ans;
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0, a, b, c; i < m; ++i) {
    scanf("%d%d%d", &a, &b, &c);
    colo[a].push_back(c), colo[b].push_back(c);
    info[i] = make_pair(make_pair(a, b), c);
  }
  for (int i = 1; i <= n; ++i) ccnt[i] = rarg(colo[i]) + ccnt[i - 1];
  init();
  for (int i = 0, a, b, c, A, B; i < m; ++i) {
    a = info[i].first.first;
    b = info[i].first.second;
    c = info[i].second;
    A = find(a, c), B = find(b, c);
    merge(A, B);
  }
  scanf("%d", &q);
  for (int i = 0, a, b; i < q; ++i) {
    scanf("%d%d", &a, &b);
    pair<int, int> p = make_pair(a, b);
    if (memo.count(p))
      printf("%d\n", memo[p]);
    else {
      if (colo[a].size() > colo[b].size()) swap(a, b);
      printf("%d\n", ccount(a, b));
    }
  }
  return 0;
}
