#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int maxn=10000+5;
const int maxm=200000+5;
int read()
{int x=0,f=1; char ch=getchar();while(ch<'0'||ch>'9'){if(ch=='-') f=-1; ch=getchar();}while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}return x*f;
}
int n,m,q,num;
int father[maxn],dep[maxn],nxt[maxm],head[maxn],f[maxn],dis[maxn];
bool vis[maxn];
struct node
{int from,to,dist;bool operator < (const node& j) const {return dist<j.dist;}
}e[maxm],c[maxm];
void add(int from,int to,int dist)
{e[++num].from=from;e[num].to=to;e[num].dist=dist;nxt[num]=head[from];head[from]=num;
}
int find(int x)
{if(x!=father[x]) father[x]=find(father[x]);return father[x];
}
void dfs(int x)
{vis[x]=1;for(int i=head[x];i;i=nxt[i]){int to=e[i].to;if(!vis[to]){f[to]=x;dep[to]=dep[x]+1;dis[to]=e[i].dist;dfs(to);}}
}
int lca(int x,int y)
{int maxx=0;if(dep[x]>dep[y]) swap(x,y);while(dep[x]<dep[y]){maxx=max(maxx,dis[y]);y=f[y];}while(x!=y){maxx=max(maxx,dis[x]);maxx=max(maxx,dis[y]);x=f[x];y=f[y];}return maxx;
}int main()
{n=read();m=read();for(int i=1;i<=n;i++) father[i]=i;for(int i=1;i<=m;i++){c[i].from=read();c[i].to=read();c[i].dist=read();}sort(c+1,c+1+m);for(int i=1;i<=m;i++){int x=find(c[i].from);int y=find(c[i].to);if(x!=y){father[x]=y;add(c[i].from,c[i].to,c[i].dist);add(c[i].to,c[i].from,c[i].dist);}}dfs(1);q=read();for(int i=1;i<=q;i++){int a,b;a=read();b=read();printf("%d\n",lca(a,b));}return 0;
}