#include<iostream>
#include<cstdio>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<string>
#include<cmath>
#include<cstring>
#include<set>
#include<map>
using namespace std;
struct Node{
    int v,next,w;
}Adj[100006];
int cnt=0,pre[100006],f[10005],dep[10005],fa[10005][25],d[10005][25],vis[100005];
struct node{
    int x,y,z;
}edge[100006];
void add(int u,int v,int w){
    Adj[++cnt].v=v;
    Adj[cnt].w=w;
    Adj[cnt].next=pre[u];//pre表示前一条边的下标
    pre[u]=cnt;//更新
}
void dfs1(int x){
	vis[x]=1;
    for(int i=pre[x];i;i=Adj[i].next){
        if(vis[Adj[i].v]==0){
            dep[Adj[i].v]=dep[x]+1;
            fa[Adj[i].v][0]=x;
            d[Adj[i].v][0]=Adj[i].w;
            dfs1(Adj[i].v);
        }
    }
}
int LCA(int x,int y){//LCA板子，但往上跳时计算最小限重
    if(dep[x]<dep[y]) swap(x,y);
    int Ans=999999999;
    for(int i=20;i>=0;--i){
        if(dep[fa[y][i]]>dep[x]){
            Ans=min(Ans,d[x][i]);
//            cout<<Ans<<" ";
            x=fa[x][i];
        }
    }
//    cout<<x<<" "<<y<<"\n";
    if(x==y) return Ans;
    for(int i=20;i>=0;--i){
        if(fa[x][i]!=fa[y][i]){
            Ans=min({Ans,d[x][i],d[y][i]});
            x=fa[x][i],y=fa[y][i];
        }
    }
//    cout<<Ans<<" "<<d[x][0]<<" "<<d[y][0]<<"\n";
    return min({Ans,d[x][0],d[y][0]});
}
int find(int x){
    return (f[x]==x?x:f[x]=find(f[x]));
}
bool cmp(node x,node y){
	return x.z>y.z;
}
int main(){
//  freopen("test.in","r",stdin);
//  freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n,m;
    cin>>n>>m;
    for(int i=1;i<=m;++i){
        cin>>edge[i].x>>edge[i].y>>edge[i].z;
    }
    sort(edge+1,edge+m+1,cmp);
    for(int i=1;i<=n;++i) f[i]=i;
    for(int i=1;i<=m;++i){
        int x=find(edge[i].x),y=find(edge[i].y);
        if(x==y) continue;
        add(edge[i].x,edge[i].y,edge[i].z);
        add(edge[i].y,edge[i].x,edge[i].z);
        f[x]=(y);
    }
     memset(d,0x3f,sizeof d);
	
    for(int i=1;i<=n;++i){
        if(find(i)==i&&vis[i]==0)dep[i]=1,dfs1(i),fa[i][0]=i,d[i][0]=0x3f3f3f3f;
    }

for(int i=1;i<=20;i++)
        for(int j=1;j<=n;j++){
            fa[j][i]=fa[fa[j][i-1]][i-1];
            d[j][i]=min(d[j][i-1],d[fa[j][i-1]][i-1]);
        }
    int q;cin>>q;
    while(q--){
        int x,y;
        cin>>x>>y;
        if(find(x)!=find(y)){
            cout<<-1<<'\n';
        }else{
            cout<<LCA(x,y)<<'\n';
        }
    }
    return 0;
}