#include <algorithm>
#include <cstring>
#include <cstdio>
#include <cmath>#define y1 mmpusing namespace std;const int M(2333);
const int N(110<<2);
const double INF(1e15);int n,city_num,A,B;
double dis[N][N],ans;
int air_cost,road_cost[N];
int x1,x2,x3,x4,y1,y2,y3,y4,d1,d2,d3;struct Node
{int x,y;Node(int x=0,int y=0): x(x),y(y) {}
}airport[M];int Get_dis(int a,int aa,int b,int bb)
{return (a-b)*(a-b)+(aa-bb)*(aa-bb);
}void init()
{memset(dis,0,sizeof(dis));memset(airport,0,sizeof(airport));    memset(road_cost,0,sizeof(road_cost));
}int main()
{scanf("%d",&n);for(;n;n--){init();scanf("%d%d%d%d",&city_num,&air_cost,&A,&B);for(int i=1;i<=city_num;i++){scanf("%d%d%d%d%d%d",&x1,&y1,&x2,&y2,&x3,&y3);scanf("%d",road_cost+i);d1=Get_dis(x1,y1,x2,y2);d2=Get_dis(x2,y2,x3,y3);d3=Get_dis(x3,y3,x1,y1);if(d1>d2&&d1>d3)x4=x1+x2-x3,y4=y1+y2-y3;else if(d2>d1&&d2>d3)x4=x2+x3-x1,y4=y2+y3-y1;else if(d3>d1&&d3>d2)x4=x3+x1-x2,y4=y3+y1-y2;airport[(i<<2)-3]=Node(x1,y1);airport[(i<<2)-2]=Node(x2,y2);airport[(i<<2)-1]=Node(x3,y3);airport[(i<<2)-0]=Node(x4,y4);}for(int i=0;i<=(city_num<<2);i++)for(int j=0;j<=(city_num<<2);j++)if(i!=j) dis[i][j]=INF;for(int i=0;i<=(city_num<<2);i++)for(int j=0;j<=(city_num<<2);j++){double dist=sqrt(Get_dis(airport[i].x,airport[i].y,airport[j].x,airport[j].y));if(i+3>>2==j+3>>2)dis[i][j]=dist*(road_cost[i+3>>2]);elsedis[i][j]=dist*air_cost;}dis[0][(A<<2)-3]=0;dis[0][(A<<2)-2]=0;dis[0][(A<<2)-1]=0;dis[0][(A<<2)-0]=0;for(int k=0;k<=(city_num<<2);k++)for(int i=0;i<=(city_num<<2);i++)for(int j=0;j<=(city_num<<2);j++)dis[i][j]=min(dis[i][j],dis[i][k]+dis[k][j]);ans=min(min(dis[0][(B<<2)-3],dis[0][(B<<2)-2]),min(dis[0][(B<<2)-1],dis[0][B<<2]));printf("%.1lf\n",ans);}return 0;
}