#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;++i)
#define per(i,n) for(int i=n;i>=1;--i)
#define pb push_back
#define mp make_pair
#define N 210000
struct xorbase {
	int a[30];
	bool ins(int w) {
		for(int i = 29;i >= 0;--i) {
			if(w >> i & 1) {
				if(a[i]) {
					w ^= a[i];
				} else {
					a[i] = w;
					return 1;
				}
			}
		}
		return 0;
	}
	bool test(int w) {
		for(int i = 29;i >= 0;--i) if(w >> i & 1) {
			w ^= a[i];
		}
		return w == 0;
	}
} T[N];
int n,m,q;
struct Edge
{
	int x,y,w;
	friend bool operator <(Edge x,Edge y)
	{
		return x.w<y.w;
	}
}edge[N];

struct Query
{
	int x,y,h,id;
};
vector<Query> Q[N],QQ[N];
map<int,int> first,last;
int ans[N],v[N];
int father[N],sum[N];
int getfather(int x)
{
	if (x==father[x])return x;
	int ret=getfather(father[x]);
	sum[x]^=sum[father[x]];
	return father[x]=ret;
}
void ask(Query x,int w)
{
	if (ans[x.id]!=-1)return;
	int t1=getfather(x.x);
	int t2=getfather(x.y);
	if (t1!=t2)return;
	if (T[t1].test(sum[x.x]^sum[x.y]^x.h))ans[x.id]=w;
}
int main()
{
	cin>>n>>m;
	rep(i,m)scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
	sort(edge+1,edge+m+1);
	rep(i,n)father[i]=i;
	cin>>q;
	rep(i,q)
	{
		int x,y,h;
		scanf("%d%d%d",&x,&y,&h);
		Q[x].pb((Query){x,y,h,i});
		Q[y].pb((Query){x,y,h,i});
	}
	rep(i,q)ans[i]=-1;
	
	for(auto ee:edge)
	{
		int x=ee.x,y=ee.y,w=ee.w;
		int t1=getfather(x);
		int t2=getfather(y);
		if(t1==t2) 
		{
			T[t1].ins(w^sum[x]^sum[y]);
			for(auto p:QQ[t1])ask(p,w);
			continue;
		}
		//t1!=t2, not the same component
		//merge t1 -> t2
		if(Q[t1].size()>Q[t2].size())swap(t1,t2),swap(x,y);
		for(auto p:QQ[t1])QQ[t2].pb(p);
		for(auto p:Q[t1])Q[t2].pb(p);
		father[t1]=t2;
		sum[t1]=sum[x]^sum[y]^w;

		for(int i=0;i<=29;i++)
			if (T[t1].a[i])
				T[t2].ins(T[t1].a[i]);
		for(auto p:QQ[t2])ask(p,w);
		for(auto p:QQ[t1])ask(p,w);
		for(auto p:Q[t1]) {
			if(!v[p.id])
				if (getfather(p.x)==getfather((p.y)))
				{
					v[p.id] = 1;
					QQ[t2].push_back(p);
					ask(p,w);
				}
		}
	}

	rep(i,q)printf("%d\n",ans[i]);
	return 0;
}