#include <bits/stdc++.h>
#define LL long long
#define db double
using namespace std;

const db eps = 1e-10;
int T;
db n, p[2], v[2];

db calc (int x, db l, db r) {
	return (r - l + min (p[x] - l, r - p[x])) / v[x];
}

int main() {
	int i,j,k;
	scanf ("%d", &T);
	while (T--) {
		scanf ("%lf%lf%lf%lf%lf", &n, &p[0], &v[0], &p[1], &v[1]);
		db ans = min (calc (0, 0, n), calc (1, 0, n));
		//cout << n << endl;
		//cout << calc (0, 0, n) << endl;
		if (p[0] > p[1]) swap (p[0], p[1]), swap (v[0], v[1]);
		db L = p[0], R = p[1];
		while (L + eps < R) {
			db fm = (R - L) / 3.0, m1 = L + fm, m2 = R - fm;
			db a1 = max (calc (0, 0, m1), calc (1, m1, n));
			db a2 = max (calc (0, 0, m2), calc (1, m2, n));
			if (a1 < a2) R = m2;
			else L = m1;
		}
		ans = min (ans, max (calc (0, 0, L), calc (1, L, n)));
		printf ("%.9lf\n", ans);
	}
	return 0;
}