//考虑最大生成树
//考虑lca（树剖） 
//顺便边权转点权 
//st表维护区间最小值 
#include<iostream>
#include<vector>
#include<algorithm>
#include<cmath>
using namespace std;
int n,m,q;
struct Edge{
	int from,to,val;
}e[50005];
vector<Edge> G[10004];
//----kruskal--
int fa[10006];
int find(int x){
	if(fa[x]==x)return x;
	else return fa[x]=find(fa[x]);
}
int merge(int x,int y){
	fa[find(x)]=find(y);
}
bool cmp1(const Edge &x,const Edge &y){
	return x.val>y.val;
}
void kruskal(){
	sort(e+1,e+m+1,cmp1);
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=m;i++){
		if(find(e[i].to)==find(e[i].from))continue;
		else {
			merge(e[i].to,e[i].from);
			G[e[i].from].push_back(e[i]);
			Edge t;
			t=e[i];
			swap(t.from,t.to);
			G[e[i].to].push_back(t);
		}
	}
}
//-------树剖------- 
struct Node{
	int dep,fa,h_son,size,val,id,top;
}nod[10005];
int cntid,rid[10005];
bool vis[10005];
void dfs1(int x,int fa){
//	cout<<x<<endl;
	nod[x].fa=fa;
	nod[x].size=1;
	nod[x].dep=nod[fa].dep+1;
	vis[x]=true;
	for(Edge i:G[x]){
	//	cout<<"to "<<i.to<<endl;
	//	cout<<"from "<<i.from<<endl; 
		if(i.to==fa)continue;
		dfs1(i.to,x);
		nod[x].size+=nod[i.to].size;
		if(nod[nod[x].h_son].size<nod[i.to].size)nod[x].h_son=i.to;
		nod[i.to].val=i.val;
	}
}
void dfs2(int x,int top){
	nod[x].top=top;
	nod[x].id=++cntid;
	rid[cntid]=x;
	if(nod[x].h_son)dfs2(nod[x].h_son,top);
	for(Edge i:G[x]){
		if(i.to==nod[x].fa||i.to==nod[x].h_son)continue;
		dfs2(i.to,i.to);
	}
}
//-------END---------
//----Stable--------
struct STable{
	int minn[50005][20];
	void build(){
		for(int i=1;i<=n;i++){
			minn[i][0]=nod[rid[i]].val;
		}
		for(int i=1;(1<<i)<=n;i++){
			for(int j=1;j+(1<<(i))-1<=n;j++){
				minn[j][i]=min(minn[j][i-1],minn[j+(1<<(i-1))][i-1]);
			}
		}
	}
	int query(int x,int y){
		int lg=log(y-x+1)/log(2);
		return min(minn[x][lg],minn[y-(1<<lg)+1][lg]);
	}
}ST;
//--------END---------
//-----Opration------
int Q(int x,int y){
	if(find(x)!=find(y))return -1;
	int re=0x7fffffff;
	while(nod[x].top!=nod[y].top){
		if(nod[nod[x].top].dep<nod[nod[y].top].dep)swap(x,y);
		re=min(re,ST.query(nod[nod[x].top].id,nod[x].id));
		x=nod[nod[x].top].fa;
	}
	if(x==y)return re;
	if(nod[x].dep>nod[y].dep)swap(x,y);
	re=min(re,ST.query(nod[nod[x].h_son].id,nod[y].id));
	return re;
}
//--------END-------
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>e[i].from>>e[i].to>>e[i].val;
	}
	kruskal();
	for(int i=1;i<=n;i++){
		if(!vis[i]){
			dfs1(i,0);
			dfs2(i,i);
		//	cout<<i<<" ";
		} 
	}
	ST.build();
	cin>>q;
	for(int i=1;i<=q;i++){
		int u,v;
		cin>>u>>v;
		cout<<Q(u,v)<<"\n";
	}
	return 0;
}