#include <stdio.h>

 #include <string.h>

 #include <queue>

 #include <algorithm>

 #include <stack>

 const int N=;

 const int INF=<<;

 using namespace std;

 struct node

 {

     int u,v,w;

     int next;

 } edge[N*N];

                               //dfn[i]表示点i的深度优先数;

 int dfn[N],low[N],head[N];    //low[i]表示点i可到达的最低深度优先数

 int Conn_num[N],vis[N],dis[N];//Conn_num[i]表示点i所属的连通分量的编号；

 int n,m,cnt,dfs_clock,Conn_cnt;

 stack<int>S;

 void init()

 {

     cnt = ;

     dfs_clock = ;

     Conn_cnt = ;

     memset(dfn,,sizeof(dfn));

     memset(low,,sizeof(low));

     memset(vis,,sizeof(vis));

     memset(Conn_num,,sizeof(Conn_num));

     memset(head,-,sizeof(head));

 }

 void add(int u,int v,int w)

 {

     edge[cnt].u = u;

     edge[cnt].v = v;

     edge[cnt].w = w;

     edge[cnt].next = head[u];

     head[u] = cnt++;

 }

 void dfs(int u)//Tarjan算法

 {

     dfn[u]=low[u]=++dfs_clock;//设定初值

     S.push(u);//将节点u压入栈中

     for (int i = head[u]; i!=-; i=edge[i].next)//遍历u的临接点

     {

         int v = edge[i].v;

         if (!dfn[v])//如果改点的深度优先数为0(即没有搜索过)

         {

             dfs(v);//继续向下找

             low[u] = min(low[u],low[v]);//回溯过程中计算low[]的值

         }

         else if(!Conn_num[v])//v不在连通分量中，即v还在栈中

         {

             low[u] = min(low[u],dfn[v]);

         }

     }

     if (dfn[u]==low[u])//找到一个连通分量

     {

         ++Conn_cnt;//连通分量计数

         while()//将栈里属于同一个连通分量的点弹出

         {

             int v = S.top();

             S.pop();

             Conn_num[v] = Conn_cnt;//表示点v在第Conn_cnt个连通分量里

             if (v==u)

                 break;

         }

     }

 }

 void spfa(int s)//缩点后求最短路

 {

     queue<int>q;

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

     {

         dis[i] = INF;

         vis[i] = ;

     }

     dis[s] = ;

     q.push(s);

     vis[s] = ;

     while(!q.empty())

     {

         int u = q.front();

         q.pop();

         vis[u] = ;

         for (int j = head[u]; j!=-; j = edge[j].next)

         {

             int v = edge[j].v;

             int w = edge[j].w;

             if(Conn_num[u]==Conn_num[v])//如果属于同一个连通分量，其权值为0

                 w = ;

             if (dis[v]>dis[u]+w)

             {

                 dis[v] = dis[u]+w;

                 if (!vis[v])

                 {

                     q.push(v);

                     vis[v] = ;

                 }

             }

         }

     }

 }

 int main()

 {

     int s,t;

     int u,v,w,k;

     while(~scanf("%d%d",&n,&m))

     {

         if (n==&&m==)

             break;

         init();

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

         {

             scanf("%d%d%d",&u,&v,&w);

             add(u,v,w);

         }

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

         {

             if (!dfn[i])

                 dfs(i);

         }

         scanf("%d",&k);

         while(k--)

         {

             scanf("%d%d",&s,&t);

             if (Conn_num[s]==Conn_num[t])

                 printf("0\n");

             else

             {

                 spfa(s);

                 if(dis[t] >= INF)

                     printf("Nao e possivel entregar a carta\n");

                 else

                     printf("%d\n",dis[t]);

             }

         }

         printf("\n");

     }

     return ;

 }