#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 3050;
const int M = 500050;
const int inf = 987654321;
int n,m,q;
struct Edge
{int u,v,w;
}xu[M];
int point[N],to[M],next[M],val[M];
int dui[N],mina[N],minb[N],top,tail;
bool indui[N];
void MakeMinLen(int x[])
{int i;dui[1]=1;top=0;tail=1;indui[1]=1;for(i=1;i<=n;i++)x[i]=inf;x[1]=0;while(top^tail){top++;if(top==N)top=0;int now=dui[top];int then=point[now];indui[now]=0;while(then){int tox=to[then];if(x[tox]>x[now]+val[then]){x[tox]=x[now]+val[then];if(!indui[tox]){indui[tox]=1;tail++;if(tail==N)tail=0;dui[tail]=tox;}}then=next[then];}}
}
void InitGraph()
{int i;scanf("%d%d",&n,&m);for(i=1;i<=m;i++)scanf("%d%d%d",&xu[i].u,&xu[i].v,&xu[i].w);memset(point,0,sizeof point);for(i=1;i<=m;i++){next[i]=point[xu[i].v];point[xu[i].v]=i;to[i]=xu[i].u;val[i]=xu[i].w;}MakeMinLen(mina);memset(point,0,sizeof point);for(i=1;i<=m;i++){next[i]=point[xu[i].u];point[xu[i].u]=i;to[i]=xu[i].v;val[i]=xu[i].w;}MakeMinLen(minb);
}
void MakeAns()
{scanf("%d",&q);while(q--){int a,b;scanf("%d%d",&a,&b);int res=mina[a]+minb[b];if(res>=inf)res=-1;printf("%d\n",res);}
}
int main()
{freopen("data.in","r",stdin);freopen("data.out","w",stdout);InitGraph();MakeAns();return 0;
}

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#define inf ~0U>>2
#define maxn 3005
using namespace std;
struct orz{int d;int p;friend bool operator < (orz a,orz b){return a.d > b.d;}
};
struct edge{int v;int w;
};
priority_queue< orz > ss;
vector<edge> g[maxn],op[maxn];
int n,m,q,flag = 0,v[maxn],d[maxn],opd[maxn];
void init(){cin>>n>>m;int u,v,w;edge tmp;for(int i = 1;i <= m;i++){scanf("%d%d%d",&u,&v,&w);tmp.v = v;tmp.w = w;g[u].push_back(tmp);tmp.v = u;op[v].push_back(tmp);}cin>>q;for(int i = 1;i <= n;i++) d[i] = opd[i] = inf;
}
void dij(){orz tmp;tmp.d = 0;tmp.p = 1;opd[1] = 0;ss.push(tmp);flag++;int x,dd,to,wei;edge j;while(!ss.empty()){tmp = ss.top();ss.pop();x = tmp.p;dd = tmp.d;if(v[x] == flag) continue;v[x] = flag;for(int i = 0;i < g[x].size();i++){j = g[x][i];to = j.v;wei = j.w;if(d[to] > dd + wei){d[to] = dd + wei;tmp.d = dd + wei;tmp.p = to;ss.push(tmp);}}}
}
void opdij(){orz tmp;tmp.d = 0;tmp.p = 1;opd[1] = 0;ss.push(tmp);flag++;int x,dd,to,wei;edge j;while(!ss.empty()){tmp = ss.top();ss.pop();x = tmp.p;dd = tmp.d;if(v[x] == flag) continue;v[x] = flag;for(int i = 0;i < op[x].size();i++){j = op[x][i];to = j.v;wei = j.w;if(opd[to] > dd + wei){opd[to] = dd + wei;tmp.d = dd + wei;tmp.p = to;ss.push(tmp);}}}
}
void ask(){int u,v;long long dn;for(int i = 1;i <= q;i++){scanf("%d%d",&u,&v);dn = opd[u] + d[v];if(dn >= inf) cout<<-1<<endl;else cout<<dn<<endl;}
}
int main(){freopen("data.in","r",stdin);freopen("data.out","w",stdout);init();dij();opdij();ask();return 0;
}