#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

typedef long double db;

const db EPS = 1e-9;

db a[2][3];

pair<db, db> solve() {
	db delta = a[0][0] * a[1][1] - a[1][0] * a[0][1];
	db deltaX = a[0][2] * a[1][1] - a[1][2] * a[0][1];
	db deltaY = a[0][0] * a[1][2] - a[1][0] * a[0][2];
	return {deltaX / delta, deltaY / delta};
}

db va, vb, xA, yA, xB, yB, xC, yC;

db f(db xD, db yD) {
	db t = (abs(xD - xA) + abs(yD - yA)) / va;
	if (abs((abs(xD - xB) + abs(yD - yB)) / vb - t) > EPS) {
		return 1e18;
	}
	return t + (abs(xC - xD) + abs(yC - yD)) / vb;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int t;
	cin >> t;
	while (t--) {
		cin >> va >> vb >> xA >> yA >> xB >> yB >> xC >> yC;
		if (xA > xC) {
			xA *= -1;
			xB *= -1;
			xC *= -1;
		}
		if (yA > yC) {
			yA *= -1;
			yB *= -1;
			yC *= -1;
		}
		db ans = (xC - xA + yC - yA) / va;
		for (int sx : {-1, 1}) {
			for (int sy : {-1, 1}) {
				a[0][0] = 1 / va + sx / vb;
				a[0][1] = 1 / va + sy / vb;
				a[0][2] = (xA + yA) / va + (sx * xB + sy * yB) / vb;
				for (db xD : {xA, xB, xC}) {
					a[1][0] = 1;
					a[1][1] = 0;
					a[1][2] = xD;
					auto [x, y] = solve();
					assert(abs(x - xD) < EPS);
					ans = min(ans, f(x, y));
				}
				for (db yD : {yA, yB, yC}) {
					a[1][0] = 0;
					a[1][1] = 1;
					a[1][2] = yD;
					auto [x, y] = solve();
					assert(abs(y - yD) < EPS);
					ans = min(ans, f(x, y));
				}
			}
		}
		cout << ans << "\n";
	}
	return 0;
}