#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1000 + 10;
vector<int> adj[MAXN][MAXN];
bool mark[MAXN];
long long int mod = 1000 * 1000 * 1000 + 7;
void addEdge(int x, int y, int c) {
  adj[c][x].push_back(y);
  adj[c][y].push_back(x);
}
void dfs(int u, int c) {
  mark[u] = true;
  for (int i = 0; i < adj[c][u].size(); i++) {
    int x = adj[c][u][i];
    if (!mark[x]) dfs(x, c);
  }
  return;
}
void cl(int n) {
  for (int i = 0; i <= n; i++) mark[i] = false;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int x, y, c;
    cin >> x >> y >> c;
    addEdge(x, y, c);
  }
  int q;
  cin >> q;
  for (int i = 0; i < q; i++) {
    int x, y;
    cin >> x >> y;
    int ans = 0;
    for (int j = 1; j <= m; j++) {
      cl(n);
      dfs(x, j);
      if (mark[y]) {
        ans++;
      }
    }
    cout << ans << endl;
  }
  return 0;
}
