program path;
var
  n,m,q,i,j,k,l1,l2,a,b,c:longint;
  t:double;
  tab:array[1..50,1..50]of longint;
  hx:array[1..50,1..50]of boolean;
  ans:array[1..50,1..50,1..1000]of longint;
begin
  assign(input,'path.in');
  assign(output,'path.out');
  reset(input);
  rewrite(output);
  readln(n,m);
  fillchar(tab,sizeof(tab),0);
  fillchar(ans,sizeof(ans),0);
  fillchar(hx,sizeof(hx),false);
  for i:=1 to m do
  begin
    readln(a,b,c);
    tab[a,b]:=c;
    hx[a,b]:=true;
    ans[a,b,1]:=c;
  end;
  for k:=1 to n do
    for i:=1 to n do
      for j:=1 to n do
        if (hx[i,k])and(hx[k,j]) then begin
          hx[i,j]:=true;
          for l1:=1 to m do
            for l2:=1 to m-l1 do
              if (ans[i,k,l1]<>0)and(ans[k,j,l2]<>0) then begin
                if ans[i,j,l1+l2]=0 then begin
                  ans[i,j,l1+l2]:=ans[i,k,l1]+ans[k,j,l2];
                end
                else
                  if ans[i,k,l1]+ans[k,j,l2]<ans[i,j,l1+l2] then
                    ans[i,j,l1+l2]:=ans[i,k,l1]+ans[k,j,l2];
              end;
        end;
  readln(q);
  for i:=1 to q do
  begin
    readln(a,b);
    t:=1.7e308;
    for j:=1 to m do
      if ans[a,b,j]<>0 then
        if ans[a,b,j]/j<t then t:=ans[a,b,j]/j;
    writeln(t:0:3);
  end;
  close(input);
  close(output);
end.