#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>#define N 10007
#define M 100007using namespace std;
int head[N],f[N][22],g[N][22],fa[N],deep[N];
int n,m,ans,cnt,t,x,y;
struct edge
{int u,to,dis,next;}e[M];
struct node
{int u,to,dis;bool operator < (const node &x) const{     //记住怎么写！ return dis<x.dis;}
}p[M];inline void add(int u,int to,int dis)
{e[++cnt].u=u;e[cnt].to=to;e[cnt].dis=dis;e[cnt].next=head[u];head[u]=cnt;
}inline int read()
{int x=0,f=1;char c=getchar();while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';c=getchar();}return x*f;
}void dfs(int now,int from,int c,int wa)
{f[now][0]=from;deep[now]=c;g[now][0]=wa;for(int i=head[now];i;i=e[i].next){int v=e[i].to;if(v!=from) dfs(v,now,c+1,e[i].dis);}
}inline void get_fa()
{for(int j=1;j<=20;j++)for(int i=1;i<=n;i++){g[i][j]=max(g[i][j-1],g[f[i][j-1]][j-1]);//是f[i][j-1],不是g[i][j-1]!!! f[i][j]=f[f[i][j-1]][j-1];}
}int LCA(int a,int b)
{int ret=0;if(deep[a]<deep[b]) swap(a,b);int t=deep[a]-deep[b];for(int i=0;i<=20;i++){if(t&(1<<i)) {ret=max(ret,g[a][i]);a=f[a][i];//两行顺序不要倒！
        }}if(a==b) return ret;for(int i=20;i>=0;i--){if(f[a][i]!=f[b][i]){ret=max(ret,g[a][i]);ret=max(ret,g[b][i]);a=f[a][i];b=f[b][i];}}ret=max(ret,max(g[a][0],g[b][0]));return ret;
}inline int find(int x)
{if(x==fa[x]) return x;return x=find(fa[x]);
}int main()
{n=read();m=read();for(int i=1;i<=m;i++){p[i].u=read();p[i].to=read();p[i].dis=read();}sort(p+1,p+m+1);int tot=0;for(int i=1;i<=n;i++) fa[i]=i;for(int i=1;i<=m;i++){int sa=find(p[i].u),sb=find(p[i].to);if(sa!=sb){fa[sb]=sa;tot++;add(p[i].u,p[i].to,p[i].dis);//我艹！再写add(sa,sb,p[i].dis)剁手！！！
            add(p[i].to,p[i].u,p[i].dis);}if(tot==n-1) break;}t=read();dfs(1,0,0,0);get_fa();for(int i=1;i<=t;i++){x=read();y=read();ans=LCA(x,y);printf("%d\n",ans);}return 0;return 0;return 0;
}