#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long linf = 1e18 + 5;
const int N = 1e5 + 5;
int n, m, x, y, t, root[N];
map<int, int> dp[N];
vector<pair<int, int> > v[N], comp[N];
int f(int x) {
  if (x == root[x]) return x;
  return root[x] = f(root[x]);
}
int main() {
  ios ::sync_with_stdio(0);
  cin >> n >> m;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y >> t;
    v[t].push_back(make_pair(x, y));
  }
  for (int i = 1; i <= m; i++) {
    for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end();
         it++) {
      root[it->first] = it->first;
      root[it->second] = it->second;
    }
    for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end();
         it++) {
      x = f(it->first);
      y = f(it->second);
      if (x == y) continue;
      root[y] = x;
    }
    for (__typeof((v[i]).begin()) it = (v[i]).begin(); it != (v[i]).end();
         it++) {
      if (comp[it->first].empty() or comp[it->first].back().first != i)
        comp[it->first].push_back(make_pair(i, f(it->first)));
      if (comp[it->second].empty() or comp[it->second].back().first != i)
        comp[it->second].push_back(make_pair(i, f(it->second)));
    }
  }
  cin >> m;
  for (int i = 1; i <= m; i++) {
    cin >> x >> y;
    if (comp[x].size() > comp[y].size()) swap(x, y);
    if (dp[x].find(y) != dp[x].end()) {
      cout << dp[x][y] << '\n';
      continue;
    }
    int ans = 0;
    for (__typeof((comp[x]).begin()) it = (comp[x]).begin();
         it != (comp[x]).end(); it++)
      if (binary_search(comp[y].begin(), comp[y].end(), *it)) ans++;
    cout << ans << '\n';
    dp[x][y] = ans;
  }
  return 0;
}
