//NOIP 2001 Car的旅行路线
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define mp make_pair
#define M(a) memset(a,0,sizeof a)
#define fo(i,j,k) for(i=j;i<=k;i++)
using namespace std;
const double inf=1e8;
const int mxn=105;
int n,s,t,A,B;
int map[10005][2],T[mxn];
double dis[mxn][mxn];
inline double calc(int j1,int j2,int mul)
{
return sqrt((double)(map[j1][0]-map[j2][0])*(double)(map[j1][0]-map[j2][0])+
(double)(map[j1][1]-map[j2][1])*(double)(map[j1][1]-map[j2][1]))*(double)mul;
}
inline double calc(int j1,int j2)
{
return sqrt((double)(map[j1][0]-map[j2][0])*(double)(map[j1][0]-map[j2][0])+
(double)(map[j1][1]-map[j2][1])*(double)(map[j1][1]-map[j2][1]))*(double)t;
}
int main()
{
int i,j,k;
scanf("%d",&n);
while(n--)
{
int num=0;double ans=inf;
scanf("%d%d%d%d",&s,&t,&A,&B);
fo(i,1,s*4)
fo(j,1,s*4)
dis[i][j]=inf;
fo(i,1,s)
{
int cnt=1,j1,j2,derx,dery;
for(num=(i-1)*4+1;cnt<=3;cnt++,num++)
scanf("%d%d",&map[num][0],&map[num][1]);
scanf("%d",&T[i]);
num=(i-1)*4+1;
if((map[num][0]-map[num+1][0])*(map[num][0]-map[num+2][0])+(map[num][1]-map[num+1][1])*(map[num][1]-map[num+2][1])==0)
derx=map[num+1][0]+map[num+2][0]-map[num][0],dery=map[num+1][1]+map[num+2][1]-map[num][1];
else if((map[num+1][0]-map[num][0])*(map[num+1][0]-map[num+2][0])+(map[num+1][1]-map[num][1])*(map[num+1][1]-map[num+2][1])==0)
derx=map[num][0]+map[num+2][0]-map[num+1][0],dery=map[num][1]+map[num+2][1]-map[num+1][1];
else
derx=map[num][0]+map[num+1][0]-map[num+2][0],dery=map[num][1]+map[num+1][1]-map[num+2][1];
map[num+3][0]=derx,map[num+3][1]=dery;
fo(j1,num,num+3)
fo(j2,num,num+3)
if(j1!=j2)
dis[j1][j2]=calc(j1,j2,T[i]);
fo(j1,num,num+3)
fo(j2,1,num-1)
if(j1!=j2)
dis[j1][j2]=dis[j2][j1]=calc(j1,j2);
}
num=s*4;
fo(k,1,num)
fo(i,1,num)
fo(j,1,num)
if(i!=j && j!=k && i!=k)
dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);
fo(i,(A-1)*4+1,(A-1)*4+4)
fo(j,(B-1)*4+1,(B-1)*4+4)
if(i!=j)
ans=min(ans,dis[i][j]);
if(A==B) ans=0.0;
printf("%.1lf\n",ans);
}
return 0;
}