#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define For(i,x,y) for(int i=x;i<=y;i++)
const int MAX = 1e6+10;
const int INF = 0x3f3f3f3f;
struct Node{int x,y,dis;}node[MAX];
struct Edge{int to,nxt,w;}edge[MAX];
int head[MAX],tot=1,bcj_fa[MAX];
int lca_fa[MAX][20],lca_w[MAX][20],deep[MAX];
bool vis[MAX];int n,m,q;
//list-like forward star
void addedge(int u,int v,int w)
{
    edge[tot].to=v;
    edge[tot].nxt=head[u];
    edge[tot].w=w;
    head[u]=tot++;
}
//bcj
int find(int x)
{
    if(bcj_fa[x]!=x) bcj_fa[x]=find(bcj_fa[x]);
    return bcj_fa[x];
}
void init()
{
    For(i,1,n) bcj_fa[i]=i;
}
//lca
void dfs(int s,int fa)
{
    vis[s]=true;
    deep[s]=deep[fa]+1;
    lca_fa[s][0]=fa;
    lca_w[s][0]=INF;
    for(int i=1;(1<<i)<=deep[s];i++)
        lca_fa[s][i]=lca_fa[lca_fa[s][i-1]][i-1];
    for(int i=head[s];i!=-1;i=edge[i].nxt)
    {
        int v=edge[i].to;
        if(vis[v]) continue;
        vis[v]=true;
       	lca_w[v][0]=edge[i].w;
        dfs(v,s);
    }
}
int lca(int x,int y)
{
    if(find(x)!=find(y)) return -1;
    int ans=INF;
    if(deep[x]<deep[y]) swap(x,y);
    for(int i=19;i>=0;i--)
        if(deep[lca_fa[x][i]]>=deep[y]) 
    {
        ans=min(ans,lca_w[x][i]);
        x=lca_fa[x][i];
    }
    if(x==y) return ans;
    for(int i=19;i>=0;i--)
    {
        if(lca_fa[x][i]!=lca_fa[y][i])
        {
            ans=min(ans,min(lca_w[x][i],lca_w[y][i]));
            x=lca_fa[x][i],y=lca_fa[y][i];
        }
    }
    return ans;
}
//krusle
bool cmp(Node a,Node b)
{
    return a.dis>b.dis;
}
void krusle()
{
    sort(node+1,node+1+m,cmp);
    For(i,1,m)
    {
        int p=find(node[i].x),q=find(node[i].y);
        if(p!=q)
        {
            bcj_fa[p]=q;
            addedge(node[i].x,node[i].y,node[i].dis);
            addedge(node[i].y,node[i].x,node[i].dis);
        }
    }
}
//solve
inline void Solve()
{
    memset(head,-1,sizeof(head));
    //memset(lca_w,INF,sizeof(lca_w));
    scanf("%d %d",&n,&m);
    For(i,1,m)
    {
        int x,y,d;scanf("%d %d %d",&x,&y,&d);
        node[i].x=x;node[i].y=y;node[i].dis=d;
    }
    init();
    krusle();
    For(i,1,n) dfs(i,0); 
    for(int i=1;i<20;i++) For(s,1,n)
        lca_w[s][i]=min(lca_w[s][i-1],lca_w[lca_fa[s][i-1]][i-1]);
    scanf("%d",&q);
    while(q--)
    {
        int x,y;scanf("%d %d",&x,&y);
        printf("%d\n",lca(x,y));
    }
}
int main()
{
    Solve();
    return 0;
}

样例过了，但全WA