#include<bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define per(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int N=200005,K=20;
int n,m,Q;
int f[N][K],g[N][K];
vector<pair<int,int> >e[N];
struct dsu{
	int fa[N];
	dsu(){iota(fa,fa+N,0);}
	int find(int u){return u==fa[u]?u:fa[u]=find(fa[u]);}
	void unite(int u,int v){fa[find(u)]=find(v);}
}o;
struct xxj{
	int b[31];
	void push(int x){
		per(i,30,0)if(x>>i&1){
			if(!b[i]){
				b[i]=x;
				return;
			}
			x^=b[i];
		}
	}
	bool check(int x){
		per(i,30,0)if(x>>i&1)x^=b[i];
		return x==0;
	}
}A[N];
int dep[N];
int val[N];
vector<tuple<int,int,int> >es;
void dfs(int u){
	rep(i,1,K-1){
		f[u][i]=f[f[u][i-1]][i-1];
		g[u][i]=max(g[u][i-1],g[f[u][i-1]][i-1]);
	}
	for(auto&[v,w]:e[u])if(v!=f[u][0]){
		dep[v]=dep[u]+1;
		val[v]=val[u]^get<0>(es[w]);
		f[v][0]=u;
		g[v][0]=w;
		dfs(v);
	}
}
int query(int u,int v){
	if(dep[u]<dep[v])swap(u,v);
	int dt=dep[u]-dep[v];
	int ret=0;
	per(i,K-1,0)if(dt>>i&1)ret=max(ret,g[u][i]),u=f[u][i];
	if(u==v)return ret;
	per(i,K-1,0)if(f[u][i]!=f[v][i])ret=max({ret,g[u][i],g[v][i]}),u=f[u][i],v=f[v][i];
	return max({ret,g[u][0],g[v][0]});
}
signed main(){
#ifdef xay5421
	freopen("a.in","r",stdin);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n>>m;
	rep(i,1,m){
		int u,v,w;
		cin>>u>>v>>w;
		es.eb(w,u,v);
	}
	sort(es.begin(),es.end());
	vector<int>is(SZ(es));
	rep(i,0,SZ(es)-1){
		int w,u,v;
		tie(w,u,v)=es[i];
		if(o.find(u)!=o.find(v)){
			is[i]=1;
			o.unite(u,v);
			e[u].eb(v,i),e[v].eb(u,i);
		}else{
			is[i]=0;
		}
	}
	dfs(1);
	rep(i,0,SZ(es)-1){
		int w,u,v;
		tie(w,u,v)=es[i];
		if(i)A[i]=A[i-1];
		if(!is[i]){
			A[i].push(val[u]^val[v]^w);
		}
	}
	cin>>Q;
	while(Q--){
		int u,v,x;
		cin>>u>>v>>x;
		int l=query(u,v),r=SZ(es)-1,ret=-1;
		while(l<=r){
			int mid=(l+r)>>1;
			if(A[mid].check(val[u]^val[v]^x))ret=mid,r=mid-1;else l=mid+1;
		}
		if(ret==-1)printf("%d\n",-1);else printf("%d\n",get<0>(es[ret]));
	}
	return 0;
}