program xxxxx;
var n,m,max,i,j,k,q,a,a1,a2:longint;
    f:array[1..50,1..50,1..2] of longint;
begin
  assign(input,'path.in');
  reset(input);
  assign(output,'path.out');
  rewrite(output);
  read(n,m);
  max:=maxlongint;
  for i:=1 to n do
    for j:=1 to n do
      begin
        f[i,j,1]:=max;
        f[i,j,2]:=0;
      end;
  for i:=1 to m do
    begin
      read(a,a1,a2);
      f[a,a1,1]:=a2;
      f[a,a1,2]:=1;
    end;
  for i:=1 to n do
    for j:=1 to n do
      for k:=1 to n do
        if (f[i,j,1]<max)and(f[j,k,1]<max) then
          if (f[i,k,2]=0)or((f[i,j,1]+f[j,k,1])/(f[i,j,2]+f[j,k,2])<f[i,k,1]/f[i,k,2]) then
            begin
              f[i,k,1]:=f[i,j,1]+f[j,k,1];
              f[i,k,2]:=f[i,j,2]+f[j,k,2];
            end;
  read(q);
  for i:=1 to q do
    begin
      read(a,a1);
      if f[a,a1,1]<max then
        writeln(f[a,a1,1]/f[a,a1,2]:0:3)
      else
        writeln('OMG!');
    end;
  close(input);
  close(output);
end.