神秘玄学错误求助

#include<iostream>
using namespace std;
int n,m,q;
struct EDGE{
	int u,v,w,nxt;
}edge[600005];
int head[200005],tot;
void add(int u,int v,int w){
	edge[++tot]={u,v,w,head[u]};
	head[u]=tot;
}
int fa[35][200005];
int Find(int qwq,int x){
	if(x==fa[qwq][x])return x;
	return fa[qwq][x]=Find(qwq,fa[qwq][x]);
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		int u,v,w;
		cin>>u>>v>>w;
		add(u,v,w);
		if(w%2==0)add(u,0,w),add(0,v,w);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=30;j++)fa[j][i]=i;
	}
	for(int i=1;i<=tot;i++){
		for(int j=1;j<=30;j++){
			int u=edge[i].u,v=edge[i].v;
			if(edge[i].w&(1<<(j-1)))fa[j][Find(j,fa[j][u])]=Find(j,fa[j][v]);
			//if(edge[i].w%2==0&&j!=1)fa[j][Find(j,fa[j][u])]=Find(j,fa[j][0]);
			if((edge[i].w&1)==0&&j!=1)fa[j][Find(j,fa[j][u])]=Find(j,fa[j][0]);
			//cout<<edge[i].w<<endl;
		}
	}
	cin>>q;
	while(q--){
		int u,v;
		cin>>u>>v;
		int f=0,f2=0;
		for(int i=1;i<=30;i++){
			if(Find(i,fa[i][u])==Find(i,fa[i][v]))f=1;
			if(i>1&&Find(i,fa[i][u])==Find(i,fa[i][0]))f2=1;
		}
		if(f){
			cout<<0<<endl;
			continue;
		}
		if(f2){
			cout<<1<<endl;
			continue; 
		}
		cout<<2<<endl;
	}
	return 0;
}