#include <bits/stdc++.h>
using namespace std;
const int N=2e6+6;
int n,m,cnt1,cnt,head[N],fa[N],f[N][20],deep[N],dis[N][20],q;
struct Node{
	int u,v,w;
}E[N];
bool cmp(Node x,Node y){
	return x.w>y.w;
}
int find(int x){return fa[x]==x?x:fa[x]=find(fa[x]);}
struct node{
	int to,nxt,w;
}e[N];
void add(int u,int v,int w){
	e[++cnt].to=v;
	e[cnt].nxt=head[u];
	e[cnt].w=w;
	head[u]=cnt;
}
void dfs(int u,int father,int w){
	dis[u][0]=w;
	deep[u]=deep[father]+1;
	f[u][0]=father;
	for(int i=1;(1<<i)<=deep[u];i++){
		f[u][i]=f[f[u][i-1]][i-1];
		dis[u][i]=min(dis[u][i-1],dis[f[u][i-1]][i-1]);
	}
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].to;
		if(v==father)continue;
		dfs(u,v,e[i].w);
	}
}
int lca(int x,int y){
	int res=0x7f7f7f7f;
	if(deep[x]<deep[y])swap(x,y);	
	for(int i=20;i>=0;i--){
		if(deep[x]-(1<<i)>=deep[y]){
			res=min(res,dis[x][i]);
			x=f[x][i];
		}
	}
	if(x==y)return res;
	for(int i=20;i>=0;i--){
		if(f[x][i]!=f[y][i]){
			res=min(res,dis[x][i]);
			res=min(res,dis[y][i]);
			x=f[x][i],y=f[y][i];
		}
	}
	res=min(res,f[x][0]);
	res=min(res,f[y][0]);
	return res;
}
int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>E[i].u>>E[i].v>>E[i].w;
	}
	sort(E+1,E+1+m,cmp);
	for(int i=1;i<=n;i++)fa[i]=i;
	for(int i=1;i<=m;i++){
		int fax=find(E[i].u),fay=find(E[i].u);
		if(fax!=fay){
			fa[fax]=fay;
			add(E[i].u,E[i].v,E[i].w);
			add(E[i].v,E[i].u,E[i].w);
			cnt1++;
		}
		if(cnt1==n-1)break;
	}
	dfs(1,0,0);
	cin>>q;
	for (int i = 1; i <= q; ++i) {
		int x, y;
		scanf("%d%d", &x, &y);
		int fx = find(x), fy = find(y);
		if (fx != fy) {
			printf("-1\n");
			continue;
		}
		printf("%d\n",lca(x, y));
	}
	
	return 0;
}