#include<bits/stdc++.h>
#define rep(i,a,b) for (int i = (a); i <= (b); ++i)
#define drep(i,a,b) for (int i = (a); i >= (b); --i)
#define LL long long
#define pii pair<int,int>
#define pll pair<LL,LL>
#define fi first
#define se second
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(),v.end()
#define sz(v) ((int)v.size())
using namespace std;
LL read() {
	LL x = 0,y = 1; char ch = getchar(); while (!isdigit(ch)) {if (ch == '-') y = -y; ch = getchar();}
	while (isdigit(ch)) {x = x*10+ch-'0'; ch = getchar();} return x*y;
}
const int tst = 0,rd = 1; int getflg = 0;
namespace qiqi {
	const int N = 105; int n,m;
	struct Pnt {
		double x,y;
		void read() {scanf("%lf%lf",&x,&y);}
		void print() {printf("%.12lf %.12lf\n",x,y);}
		double dis2() {return x*x+y*y;}
		double dis() {return sqrtl(dis2());}
		Pnt friend operator + (Pnt a,Pnt b) {
			return (Pnt){a.x+b.x,a.y+b.y};
		}
		Pnt friend operator - (Pnt a,Pnt b) {
			return (Pnt){a.x-b.x,a.y-b.y};
		}
		Pnt friend operator * (Pnt a,double b) {
			return (Pnt){a.x*b,a.y*b};
		}
	} A,B,C,D,a,b,c,d,s[N],t[N];
	double dot(Pnt a,Pnt b) {
		return a.x*b.x+a.y*b.y;
	}
	void main() {
		double ans = 1e9;
		A.read(); B.read(); C.read(); D.read();
		a.read(); b.read(); c.read(); d.read();
		s[0].read(); t[0].read();
		m = read(); n = read();
		rep(i,1,n) {
			s[i] = a+(b-a)*(dot(s[i-1]-A,B-A)/(B-A).dis2())+(d-a)*(dot(s[i-1]-A,D-A)/(D-A).dis2());
			t[i] = a+(b-a)*(dot(t[i-1]-A,B-A)/(B-A).dis2())+(d-a)*(dot(t[i-1]-A,D-A)/(D-A).dis2());
			if (tst && rd) {
				printf("s[%d]: ",i); s[i].print();
				printf("t[%d]: ",i); t[i].print();
				puts("");
			}
		}
		rep(i,0,n) rep(j,0,n-i) {
			ans = min(ans,(i+j)*m+(s[i]-t[j]).dis());
			if (tst && rd) {
//				printf("%d %d %.12lf\n\n",i,j,(i+j)*m+(s[i]-t[j]).dis());
			}
		}
		printf("%.12lf\n",ans);
	}
}
int main() {
	int T = read(); while (T--) qiqi::main(); return 0;
}