#include <bits/stdc++.h>
using namespace std;
int n, m, q;
vector<pair<int, int> > edge[100001];
int par[100001];
vector<int> v[100001];
vector<int> chi[100001];
vector<pair<int, int> > res[100001];
map<pair<int, int>, int> mp;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; i++) {
    int x, y, c;
    scanf("%d%d%d", &x, &y, &c);
    x--, y--, c--;
    edge[c].push_back(make_pair(x, y));
    v[c].push_back(x);
    v[c].push_back(y);
  }
  for (int i = 0; i < m; i++) {
    sort(v[i].begin(), v[i].end());
    vector<int> vt;
    for (int j = 0; j < v[i].size(); j++)
      if (!j || v[i][j] != v[i][j - 1]) vt.push_back(v[i][j]);
    for (int j = 0; j < vt.size(); j++) {
      chi[vt[j]].push_back(vt[j]);
      par[vt[j]] = vt[j];
    }
    for (int j = 0; j < edge[i].size(); j++) {
      int x = edge[i][j].first, y = edge[i][j].second;
      x = par[x], y = par[y];
      if (x == y) continue;
      if (chi[x].size() < chi[y].size()) swap(x, y);
      for (int k = 0; k < chi[y].size(); k++) {
        chi[x].push_back(chi[y][k]);
        par[chi[y][k]] = x;
      }
      chi[y].clear();
    }
    edge[i].clear();
    for (int j = 0; j < vt.size(); j++) {
      for (int k = 0; k < chi[vt[j]].size(); k++)
        res[chi[vt[j]][k]].push_back(make_pair(i, j));
      chi[vt[j]].clear();
    }
  }
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    x--, y--;
    if (res[x].size() > res[y].size()) swap(x, y);
    if (mp.count(make_pair(x, y))) {
      printf("%d\n", mp[make_pair(x, y)]);
      continue;
    }
    int r = 0;
    for (int j = 0; j < res[x].size(); j++) {
      pair<int, int> p = res[x][j];
      if (*lower_bound(res[y].begin(), res[y].end(), p) == p) r++;
    }
    printf("%d\n", r);
    mp[make_pair(x, y)] = r;
  }
  return 0;
}
