#include <bits/stdc++.h>
using namespace std;
int N, M;
vector<int> V[100000];
vector<pair<int, int>> C[100000];
bool seen[100000];
set<int> qv[100000];
set<int> seenset;
map<pair<int, int>, int> res;
void dfs(int x) {
  seen[x] = true;
  if (seenset.size() < qv[x].size()) {
    for (auto i : seenset)
      if (qv[x].find(i) != qv[x].end()) {
        int a = min(x, i), b = max(x, i);
        res[{a, b}]++;
      }
  } else {
    for (auto i : qv[x])
      if (seenset.find(i) != seenset.end()) {
        int a = min(x, i), b = max(x, i);
        res[{a, b}]++;
      }
  }
  seenset.insert(x);
  for (auto i : V[x])
    if (!seen[i]) dfs(i);
}
int main() {
  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--;
    C[c].push_back({a, b});
  }
  int Q;
  scanf("%d", &Q);
  vector<pair<int, int>> queries;
  for (int i = 0; i < Q; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    a--, b--;
    qv[a].insert(b);
    qv[b].insert(a);
    queries.push_back({min(a, b), max(a, b)});
  }
  for (int i = 0; i < M; i++)
    if (C[i].size()) {
      memset(seen, 0, sizeof(seen));
      for (auto& elem : C[i]) {
        V[elem.first].push_back(elem.second);
        V[elem.second].push_back(elem.first);
      }
      for (auto& elem : C[i]) {
        int a = elem.first, b = elem.second;
        if (!seen[a]) {
          seenset.clear();
          dfs(a);
        }
      }
      for (auto& elem : C[i]) {
        V[elem.first].clear();
        V[elem.second].clear();
      }
    }
  for (auto elem : queries) printf("%d\n", res[{elem.first, elem.second}]);
  return 0;
}
