#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10,INF=1e9;
int n,m,q;
vector<tuple<int,int,int>>E;
mt19937 rnd(time(0));
vector<tuple<int,int,int>>Q;
int p[N];
int find(int x){
    return p[x]==x?x:p[x]=find(p[x]);
}
struct edges{
    int to,w,nex;
}edge[N*2];
int kk,head[N];
void add(int u,int v,int w){
    edge[++kk]={v,w,head[u]},head[u]=kk;
}
int vis[N],fa[N];
int dis[N];
void dfs(int u,int fa=0){
    ::fa[u]=fa;
    for(int i=head[u];i;i=edge[i].nex){
        int v=edge[i].to;
        if(v==fa)continue;
        dis[v]=dis[u]+edge[i].w;
        dfs(v,u);
    }
}
void run(){
    shuffle(E.begin(),E.end(),rnd);
    iota(p,p+1+n,0);
    kk=0,fill(head,head+1+n,0);
    for(auto [u,v,w]:E){
        int x=find(u),y=find(v);
        if(x==y)continue;
        add(u,v,w),add(v,u,w);
        p[x]=y;
    }
    fill(vis,vis+1+n,0);
    for(int i=1;i<=n;i++)if(!vis[i])dis[i]=0,dfs(i);
    for(auto &[u,v,ans]:Q){
        if(dis[u]>dis[v])swap(u,v);
        if(fa[v]==u)ans=min(ans,dis[v]-dis[u]);
        else if(fa[v]==fa[u])ans=min(ans,dis[u]+dis[v]-dis[fa[u]]*2);
        else if(fa[fa[v]]==u)ans=min(ans,dis[v]-dis[u]);
        else if(fa[fa[fa[v]]]==u)ans=min(ans,dis[v]-dis[u]);
        else if(fa[fa[v]]==fa[u])ans=min(ans,dis[v]+dis[u]-dis[fa[u]]*2);
        else if(fa[v]==fa[fa[u]])ans=min(ans,dis[v]+dis[u]-dis[fa[v]]*2);
    }
}
int main(){
    scanf("%d%d",&n,&m);
    E.resize(m);
    for(auto &[u,v,w]:E){
        scanf("%d%d%d",&u,&v,&w);
    }
    scanf("%d",&q);
    Q.resize(q);
    for(auto &[u,v,ans]:Q){
        scanf("%d%d",&u,&v);
        ans=INF;
    }
    for(;;){
        run();
        if(1.0*clock()/CLOCKS_PER_SEC>10.5)break;
    }
    for(auto [u,v,ans]:Q)printf("%d\n",ans<INF?ans:-1);
    return 0;
}