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

typedef long long Int;
typedef pair<int,int> PII;
typedef vector<int> VInt;
 
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
#define MP make_pair

double f(double a, double b, double c)
{
	return fabs(b - c) + min(fabs(a - b), fabs(a - c));
}

void SolveTest(int test)
{
	double len, a, b, va, vb;
	cin >> len >> a >> va >> b >> vb;
	double res = min(f(a, 0, len)/va, f(b, 0, len)/vb);
	int i, j;
	FOR(i, 0, 2)
	{
		swap(a, b);
		swap(va, vb);
		double l = 0, r = len;
		double lv = max(f(a, 0, l)/va, f(b, l, len)/vb);
		double rv = max(f(a, 0, r)/va, f(b, r, len)/vb);
		FOR(j, 0, 74)
		{
			double x = (l + l + r)/3;
			double y = (l + r + r)/3;
			double xv = max(f(a, 0, x)/va, f(b, x, len)/vb);
			double yv = max(f(a, 0, y)/va, f(b, y, len)/vb);
			if(xv < yv) 
			{
				r = y;
				rv = yv;
			}
			else
			{
				l = x;
				lv = xv;
			}
		}
		res = min(res, min(lv, lv));
	}
	cout << fixed << setprecision(11) << res << endl;
}

int main()
{
	int T, t;
	T = 1;
	cin >> T;
	FOR(t, 0, T) 
	{
		//cerr << "Solving " << t << "/" << T << endl;
		SolveTest(t);
	}

	return 0;
}