Mr. Kitayuta's Colorful Graph

/*********************************************************
*      --------------Alfheim--------------               *
*   author AbyssalFish                                   *
**********************************************************/
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int maxn = 1e5+5, maxm = 1e5+5;

int pa[maxn], rak[maxn];

int fd(int x)
{
    return pa[x]? pa[x] = fd(pa[x]): x;
}

inline void joint(int a,int b)
{
    int x = fd(a), y = fd(b);
    if(x != y){
        if(rak[x] < rak[y]){
            pa[x] = y;
        }
        else {
            pa[y] = x;
            if(rak[x] == rak[y]) rak[x]++;
        }
    }
}


int a[maxm],b[maxm];
bool vis[maxn];

int hd_c[maxn], nx_e[maxm];

inline void add_e(int cl,int i)
{
    nx_e[i] = hd_c[cl];
    hd_c[cl] = i;
}

typedef vector<int> Block;
typedef vector<int> v_int;

vector<Block> blc;
Block tmp[maxn];
v_int in_blk[maxn];

inline void add_blc(int x)
{
    if(!vis[x]){
        vis[x] = true;
        tmp[fd(x)].push_back(x);
    }
}

inline void dump(int x)
{
    if(tmp[x].size() > 1){
        blc.push_back(tmp[x]);
        tmp[x].clear();
    }
    if(vis[x]){
        vis[x] = false;
        rak[x] = pa[x] = 0;
    }
}

const uint32_t MAXB = 448;

int ans[MAXB+5][maxn];
int id[maxn];

//#define LOCAL
int main()
{
#ifdef LOCAL
    freopen("in.txt","r",stdin);
#endif
    //cout<<(2*maxm/sqrt(2*maxm));
    int n,m,q;
    scanf("%d%d",&n,&m);
    uint32_t B = floor(2*m/sqrt(2*m));
    int i,j;
    for(i = 1; i <= m; i++){
        scanf("%d%d%d",a+i,b+i,&j);
        add_e(j,i);
    }

    for(i = 1; i <= m; i++){
        for(j = hd_c[i]; j; j = nx_e[j]){
            joint(a[j],b[j]);
        }
        for(j = hd_c[i]; j; j = nx_e[j]){
            add_blc(a[j]);
            add_blc(b[j]);
        }
        for(j = hd_c[i]; j; j = nx_e[j]){
            dump(a[j]);
            dump(b[j]);
        }
    }

    for(i = 0; i < (int)blc.size(); i++){
        for(auto v: blc[i]){
            in_blk[v].push_back(i);
        }
    }

    int id_cnt = 0;
    for(i = 1; i <= n; i++){
        if(in_blk[i].size() > B){
            id[i] = ++id_cnt;
            for(auto b_id: in_blk[i]){
                for(auto v: blc[b_id]){
                    ans[id_cnt][v]++;
                }
            }
        }
    }

    scanf("%d",&q);
    while(q--){
        int x,y; scanf("%d%d",&x,&y);
        int res;
        if(id[x]) res = ans[id[x]][y];
        else if(id[y]) res = ans[id[y]][x];
        else {
            res = i = j = 0;
            v_int &X = in_blk[x], &Y = in_blk[y];
            n = X.size(); m = Y.size();
            while(i < n && j < m){
                if(X[i] == Y[j]){
                    res++; i++; j++;
                }
                else {
                    X[i] < Y[j] ? i++ : j++;
                }
            }
        }
        printf("%d\n",res);
    }

    return 0;
}