#include <bits/stdc++.h>
using namespace std;
#define debug(fmt, ...) \
  fprintf(stderr, "[%d] " fmt "\n", __LINE__, ##__VA_ARGS__)
template <class _Tx, class _Ty>
inline void chkmin(_Tx& x, const _Ty& y) { if (y < x) x = y; }
template <class _Tx, class _Ty>
inline void chkmax(_Tx& x, const _Ty& y) { if (x < y) x = y; }
bool Mbe;
using ll = long long;
using ld = double;
struct vector2d {
  ld x, y;
};
vector2d operator+(const vector2d& u, const vector2d& v) {
  return {u.x + v.x, u.y + v.y};
}
vector2d operator-(const vector2d& u, const vector2d& v) {
  return {u.x - v.x, u.y - v.y};
}
vector2d operator*(const vector2d& u, ld k) {
  return {u.x * k, u.y * k};
}
vector2d operator*(ld k, const vector2d& u) {
  return {k * u.x, k * u.y};
}
vector2d operator/(const vector2d& u, ld k) {
  return {u.x / k, u.y / k};
}
vector2d det(const vector2d& u) {
  return {-u.y, u.x};
}
ld det(const vector2d& u, const vector2d& v) {
  return u.x * v.y - u.y * v.x;
}
ld dot(const vector2d& u, const vector2d& v) {
  return u.x * v.x + u.y * v.y;
}
ld norm2(const vector2d& u) {
  return dot(u, u);
}
ld norm(const vector2d& u) {
  return sqrt(norm2(u));
}
ld dist2(const vector2d& u, const vector2d& v) {
  return norm2(u - v);
}
ld dist(const vector2d& u, const vector2d& v) {
  return sqrt(dist2(u, v));
}
vector2d unit(const vector2d& u) {
  return u / norm(u);
}
istream& operator>>(istream& in, vector2d& p) {
  return in >> p.x >> p.y;
}
void mian() {
  int n, k;
  vector2d S, T;
  vector<vector2d> R1(4), R2(4);
  for (auto& it : R1) cin >> it;
  for (auto& it : R2) cin >> it;
  cin >> S >> T >> k >> n;
  vector2d vo = R1[0], vi = R1[3] - vo, vj = R1[1] - vo;
  vector2d wo = R2[0], wi = R2[3] - wo, wj = R2[1] - wo;
  auto map = [&](const vector2d& p, const vector2d& o,
                 const vector2d& i, const vector2d& j) -> vector2d {
    return {dot(p - o, i) / norm2(i), dot(p - o, j) / norm2(j)};
  };
  auto remap = [&](const vector2d& p, const vector2d& o,
                   const vector2d& i, const vector2d& j) -> vector2d {
    return o + p.x * i + p.y * j;
  };
  auto f = [&](const vector2d& p) {
    return remap(map(p, vo, vi, vj), wo, wi, wj);
  };
  ld ans = 1e18;
  vector2d u = S;
  for (int i = 0; i <= n; ++i, u = f(u)) {
    vector2d v = T;
    for (int j = 0; i + j <= n; ++j, v = f(v)) {
      chkmin(ans, dist(u, v) + k * (i + j));
    }
  }
  cout << fixed << setprecision(12) << ans << '\n';
}
bool Med;
int main() {
  // debug("Mem: %.4lfMB.", fabs(&Med - &Mbe) / 1048576);
  cin.tie(0)->sync_with_stdio(0);
  int cas;
  cin >> cas;
  while (cas--) mian();
  return 0;
}
/*
g++ -std=c++14 -O2 -o E E.cpp -Wall -Wextra -Wshadow
-fsanitize=address,undefined -g
*/