// Note:Your choice is C++ IDE#include <iostream>#include <cstdio>#include <cstring>#include <vector>using namespace std;const int mmax=100050;typedef struct sdlfj{int u,v,next,w;}Edge;typedef struct gf{int u,v,num; }Query;typedef struct sldf{int v,num;}Node;vector<Node>node[mmax];Edge edge[mmax];Query query[mmax];int set[mmax],d[mmax],head[mmax],check[mmax],ans[mmax];int Enum,n,m,q;void add(int u,int v,int w){edge[Enum].u=u;edge[Enum].v=v;edge[Enum].w=w;edge[Enum].next=head[u];head[u]=Enum++;}void insert(int u,int v,int w){add(u,v,w);add(v,u,w);}int findset(int x){if(set[x]==x)return x;return set[x]=findset(set[x]);}void Union(int x,int y){int a=findset(x);int b=findset(y);if(a!=b)set[a]=b;}void LCA_Tarjan(int u,int fa){int i;set[u]=u;for(i=head[u];i!=-1;i=edge[i].next){int v=edge[i].v;if(v==fa)continue;d[v]=d[u]+edge[i].w;LCA_Tarjan(v,u);Union(v,u);}check[u]=1;for(i=0;i<node[u].size();i++)//LCA(U,V);{ans[node[u][i].num]=findset(node[u][i].v);} }void function(){int i;memset(check,0,sizeof(check));for(i=1;i<=n;i++)if(!check[i])LCA_Tarjan(i,-1);for(i=0;i<q;i++){printf("%d\n",d[query[i].u]+d[query[i].v]-2*d[ans[i]]);}}void read(){int i;Enum=0;memset(head,-1,sizeof(head));for(i=0;i<m;i++){int u,v,w,s[5];scanf("%d%d%d%s",&u,&v,&w,s);insert(u,v,w);}for(i=1;i<=n;i++)node[i].clear();scanf("%d",&q);for(i=0;i<q;i++){int u,v;scanf("%d%d",&u,&v);query[i].u=u;query[i].v=v;query[i].num=i;Node cnt;cnt.num=i;cnt.v=v;node[u].push_back(cnt);cnt.v=u;node[v].push_back(cnt);}}int main(){ while(scanf("%d%d",&n,&m)!=EOF) { read(); function(); } return 0;}
