#include<bits/stdc++.h>
using namespace std;

const int maxn=5e4+5;

int n,m,q;

struct node{
	int x,y,z;
}t[maxn<<1];

bool cmp(node a,node b)
{
	return a.z>b.z;
}

int f[maxn];

int find(int x)
{
	if(x==f[x]) return x;
	f[x]=find(f[x]);
	return f[x];
}

int head[maxn],to[maxn<<1],pre[maxn<<1],w[maxn<<1];
int cnt;
void link(int x,int y,int z)
{
	to[++cnt]=y;
	pre[cnt]=head[x];
	head[x]=cnt;
	w[cnt]=z;
}

int fa[maxn][25],val[maxn][25],vis[maxn],dep[maxn]; 

void dfs(int x,int fath)
{
	dep[x]=dep[fath]+1;
	vis[x]=1;
	fa[x][0]=fath;
	for(int i=head[x];i;i=pre[i])
	{
		int y=to[i];
		if(y==fath) continue;
		val[y][0]=w[i];
		dfs(y,x);
	}
}

int lg[maxn];

int lca(int x,int y)
{
	if(find(x)!=find(y)) return -1;
	int ans=0x3f3f3f3f;
	if(dep[x]<dep[y]) swap(x,y);
	while(dep[x]>dep[y])
	{
		ans=min(ans,val[x][lg[dep[x]-dep[y]]-1]);
		x=fa[x][lg[dep[x]-dep[y]]-1];
	}
	
	if(x==y) return ans;
	
	for(int i=lg[dep[x]]-1;i>=0;i--)
	{
		if(fa[x][i]!=fa[y][i])
		{
			x=fa[x][i],y=fa[y][i];
			ans=min(ans,min(val[x][i],val[y][i]));
		}
	}
	ans=min(ans,min(val[x][0],val[y][0]));
	return ans;
}

int main(){
	//freopen("P1967_1.in","r",stdin);
	scanf("%d%d",&n,&m);
	//cin>>n>>m;
	for(int i=1;i<=m;i++)
	{
		int x,y,z;
		scanf("%d%d%d",&x,&y,&z);
		//cin>>x>>y>>z;
		t[i].x=x;
		t[i].y=y;
		t[i].z=z;
	}
	sort(t+1,t+1+m,cmp);
	
	for(int i=1;i<=n;i++) f[i]=i;
	
	for(int i=i;i<=m;i++)
	{
		int x=t[i].x,y=t[i].y,z=t[i].z;
		int fx=find(x),fy=find(y);
		if(fx!=fy)
		{
			f[fx]=fy;
			link(x,y,z);
			link(y,x,z);
		} 
	}
	for(int i=1;i<=n;i++)
	{
		if(!vis[i])
		{
			dfs(i,i);
		}
	}
	for(int i=1;i<=20;i++)
	{
		for(int j=1;j<=n;j++)
		{
			fa[j][i]=fa[fa[j][i-1]][i-1];
			val[j][i]=min(val[j][i-1],val[fa[j][i-1]][i-1]);
		}
	}
	for(int i=1;i<=n;i++)
	{
		lg[i]=lg[i-1]+(1<<lg[i-1]==i);
	}
	
	cin>>q;
	
	for(int i=1;i<=q;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		//cin>>x>>y;
		printf("%d\n",lca(x,y));
		//cout<<lca(x,y)<<endl;
	}
	return 0;
}