#include<iostream>

 #include<cstdio>

 #include<cstring>

 #include<cmath>

 #include<vector>

 #include<algorithm>

 #include<set>

 #include<map>

 #include<queue>

 #define M 100005

 #define INF 19260817

 using namespace std;

 int f[M][]={},minn[M][]={},dep[M]={},vis[M]={};

 struct edge{int u,v,next;}e[M*]={}; int head[M]={},use=;

 void dfs(int x,int fa,int v){

     vis[x]=; f[x][]=fa; dep[x]=dep[fa]+; minn[x][]=v;

     for(int i=;i<;i++)

     f[x][i]=f[f[x][i-]][i-],minn[x][i]=min(minn[x][i-],minn[f[x][i-]][i-]);

     for(int i=head[x];i;i=e[i].next) if(e[i].u!=fa) dfs(e[i].u,x,e[i].v);

 }

 int getmin(int x,int y){

     if(dep[x]<dep[y]) swap(x,y); int res=INF,cha=dep[x]-dep[y];

     for(int i=;~i;i--) if(cha&(<<i)) res=min(res,minn[x][i]),x=f[x][i];

     for(int i=;~i;i--) if(f[x][i]!=f[y][i]) res=min(res,min(minn[x][i],minn[y][i])),x=f[x][i],y=f[y][i];

     if(x==y) return res; return min(res,min(minn[x][],minn[y][]));

 }

 struct bian{

     int x,y,z; bian(){x=y=z=;}

     friend bool operator <(bian a,bian b){return a.z<b.z;}

 }a[M];

 void add(int x,int y,int z){use++;e[use].u=y;e[use].v=z;e[use].next=head[x];head[x]=use;}

 int fa[M]={};int get(int x){return fa[x]==x?x:fa[x]=get(fa[x]);}

 int main(){

     memset(minn,,sizeof(minn));

     int n,m; scanf("%d%d",&n,&m);

     for(int i=;i<=n;i++) fa[i]=i;

     for(int i=;i<=m;i++) scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);

     sort(a+,a+m+);

     for(int i=m;i;i--){

         int x=get(a[i].x),y=get(a[i].y);

         if(x==y) continue;

         add(a[i].x,a[i].y,a[i].z);

         add(a[i].y,a[i].x,a[i].z);

         fa[x]=y;

     }

     for(int i=;i<=n;i++)

     if(!vis[i]) dfs(i,,INF);

     int q; scanf("%d",&q);

     while(q--){

         int x,y; scanf("%d%d",&x,&y);

         if(get(x)!=get(y)) printf("-1\n");

         else printf("%d\n",getmin(x,y));

     }

 }