void gao() {
bcc.gao();
for (const auto& i: bcc.bcc) {
if (i.size() > 1) {
for (const auto& j: i) {
ds.setp(j.first, j.second);
}
}
}
for (const auto& i: bcc.bridge) {
int a = ds.getp(i.first);
int b = ds.getp(i.second);
e[a].push_back(b);
e[b].push_back(a);
}
}
int main() {
scanf("%d", &T);
for (int t = 1; t <= T; ++t) {
scanf("%d %d", &n, &m);
scanf("%lf %lf %lf %lf %lf %lf %lf %lf", &a.F, &a.S, &b.F, &b.S, &c.F, &c.S, &d.F, &d.S);
init(t1, n, p1, a, b);
init(t2, m, p2, c, d);
e.clear();
for (int i = 1; i < n; ++i) {
e.PB(MP(dis2(p1[i - 1], p1[i]), MP(i - 1, i)));
}
for (int i = 1; i < m; ++i) {
e.PB(MP(dis2(p2[i - 1], p2[i]), MP(n + i - 1, n + i)));
}
for (int i = 0; i < n; ++i) {
int p = ts(i, 0, m - 1);
e.PB(MP(dis2(p1[i], p2[p]), MP(i, n + p)));
if (p - 1 >= 0) {
e.PB(MP(dis2(p1[i], p2[p - 1]), MP(i, n + p - 1)));
}
if (p + 1 < m) {
e.PB(MP(dis2(p1[i], p2[p + 1]), MP(i, n + p + 1)));
}
}
std::sort(e.begin(), e.end());
ds.init(n + m);
double mst = 0;
FOR(i, e)
{
int u = (*i).S.F, v = (*i).S.S;
if (ds.setp(u, v)) {
mst += sqrt((*i).F);
}
}
printf("Case #%d: %.3lf\n", t, mst);
}
