#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


using Double = long double;

const Double EPS = 1e-10L;
const Double INF = 1e+10L;
const Double PI = acos(-1.0L);
inline int sig(Double r) { return (r < -EPS) ? -1 : (r > +EPS) ? +1 : 0; }

struct Pt {
  Double x, y;
  Pt() {}
  Pt(Double x_, Double y_) : x(x_), y(y_) {}
  Pt operator+(const Pt &a) const { return Pt(x + a.x, y + a.y); }
  Pt operator-(const Pt &a) const { return Pt(x - a.x, y - a.y); }
  Pt operator*(const Pt &a) const { return Pt(x * a.x - y * a.y, x * a.y + y * a.x); }
  Pt operator/(const Pt &a) const { const Double d2 = a.abs2(); return Pt((x * a.x + y * a.y) / d2, (y * a.x - x * a.y) / d2); }
  Pt operator+() const { return Pt(+x, +y); }
  Pt operator-() const { return Pt(-x, -y); }
  Pt operator*(const Double &k) const { return Pt(x * k, y * k); }
  Pt operator/(const Double &k) const { return Pt(x / k, y / k); }
  friend Pt operator*(const Double &k, const Pt &a) { return Pt(k * a.x, k * a.y); }
  Pt &operator+=(const Pt &a) { x += a.x; y += a.y; return *this; }
  Pt &operator-=(const Pt &a) { x -= a.x; y -= a.y; return *this; }
  Pt &operator*=(const Pt &a) { return *this = *this * a; }
  Pt &operator/=(const Pt &a) { return *this = *this / a; }
  Pt &operator*=(const Double &k) { x *= k; y *= k; return *this; }
  Pt &operator/=(const Double &k) { x /= k; y /= k; return *this; }
  Double abs() const { return sqrt(x * x + y * y); }
  Double abs2() const { return x * x + y * y; }
  Double arg() const { return atan2(y, x); }
  Double dot(const Pt &a) const { return x * a.x + y * a.y; }
  Double det(const Pt &a) const { return x * a.y - y * a.x; }
  friend ostream &operator<<(ostream &os, const Pt &a) { os << "(" << a.x << ", " << a.y << ")"; return os; }
};

inline Double tri(const Pt &a, const Pt &b, const Pt &c) { return (b - a).det(c - a); }


int main() {
  double K;
  int N;
  Pt P[10];
  
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    for (int i = 0; i < 10; ++i) {
      int x, y;
      scanf("%d%d", &x, &y);
      P[i] = Pt(x, y);
    }
    {
      int k;
      scanf("%d", &k);
      K = k;
    }
    scanf("%d", &N);
    
    const Pt dir1 = P[1] - P[0];
    const Pt dir3 = P[3] - P[0];
    const Pt dir5 = P[5] - P[4];
    const Pt dir7 = P[7] - P[4];
    
    vector<Pt> pss[10];
    for (int i = 8; i < 10; ++i) {
      pss[i].resize(N + 1);
      pss[i][0] = P[i];
      for (int j = 0; j < N; ++j) {
        const Pt p = pss[i][j];
        
        const Double t1 = (p - P[0]).dot(dir1) / dir1.abs2();
        const Double t3 = (p - P[0]).dot(dir3) / dir3.abs2();
        const Pt q = P[4] + t1 * dir5 + t3 * dir7;
        
        pss[i][j + 1] = q;
      }
    }
    
    Double ans = INF;
    for (int j8 = 0; j8 <= N; ++j8) for (int j9 = 0; j8 + j9 <= N; ++j9) {
      Double cost = 0.0;
      cost += K * (j8 + j9);
      cost += (pss[8][j8] - pss[9][j9]).abs();
// cerr<<j8<<" "<<j9<<": "<<pss[8][j8]<<" "<<pss[9][j9]<<" "<<cost<<endl;
      chmin(ans, cost);
    }
    printf("%.12Lf\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}