#include<iostream>#include<cstdio>#include<cmath>#include<vector>struct node
{
int x,y,id;
node(int x=0,int y=0,int id=0):x(x),y(y),id(id){}
};
usingnamespacestd;
constint oo=1000000000;
int n,s,t,a,b,tot=0;
doublemap[303][303];
int ti[105];
vector<node> city[105];
double dist(int x1,int y1,int x2,int y2)
{
double ans=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
returnsqrt(ans);
}
void getmap()
{
int i,j,k;
vector<node>::iterator a,b;
for (i=1;i<=s;++i)
for (a=city[i].begin();a!=city[i].end();++a)
for (b=city[i].begin();b!=city[i].end();++b)
if (a!=b)
{
map[(*a).id][(*b).id]=map[(*b).id][(*a).id]=dist((*a).x,(*a).y,(*b).x,(*b).y)*ti[i];
}
for (i=1;i<=s;++i)
for (j=1;j<=s;++j)
if (i!=j)
{
for (a=city[i].begin();a!=city[i].end();++a)
for (b=city[j].begin();b!=city[j].end();++b)
map[(*a).id][(*b).id]=map[(*b).id][(*a).id]=dist((*a).x,(*a).y,(*b).x,(*b).y)*t;
}
}
void floyd()
{
int i,j,k,ui=city[a].front().id,vi=city[b].front().id;
for (k=1;k<=tot;++k)
for (i=1;i<=tot;++i)
for (j=1;j<=tot;++j)
if (i!=j && i!=k && j!=k)
if (map[i][j]>map[i][k]+map[k][j])
map[i][j]=map[i][k]+map[k][j];
double ans=oo;
for (i=ui;i<=ui+3;++i)
for (j=vi;j<=vi+3;++j)
{
if (map[i][j]<ans)
ans=map[i][j];
}
printf("%.1f\n",ans);
}
void getanother(int i)
{
int num=0;
node ct[4];
vector<node>::iterator it;
for (it=city[i].begin();it!=city[i].end();++it)
{
ct[++num].x=(*it).x;
ct[num].y=(*it).y;
}
while ( (ct[1].x-ct[2].x)*(ct[3].x-ct[2].x)+(ct[1].y-ct[2].y)*(ct[3].y-ct[2].y) )
{
node tmp=ct[1];
ct[1]=ct[2];
ct[2]=ct[3];
ct[3]=tmp;
}
int xi=ct[1].x+ct[3].x-ct[2].x;
int yi=ct[1].y+ct[3].y-ct[2].y;
city[i].push_back(node(xi,yi,++tot));
}
void init()
{
int xi,yi,i,j;
cin>>n;
while (n--)
{
scanf("%d%d%d%d",&s,&t,&a,&b);
for (i=1;i<=s;++i)
for (j=1;j<=s;++j)
map[i][j]=oo;
for (i=1;i<=s;++i)
{
for (j=1;j<=3;++j)
{
scanf("%d%d",&xi,&yi);
city[i].push_back(node(xi,yi,++tot));
}
getanother(i);
scanf("%d",&ti[i]);
}
getmap();
floyd();
}
}
int main()
{
init();
return0;
}