#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define debug(x) cout<<#x<<": "<<x<<endl

#define double long double

void solve()
{
	double n,p1,v1,p2,v2;
	scanf("%Lf%Lf%Lf%Lf%Lf",&n,&p1,&v1,&p2,&v2);
	if(p1>p2) swap(p1,p2),swap(v1,v2);
	double ans=1e9;
	ans=min(ans,max((n-p1)/v1,p2/v2));
	ans=min(ans,(p1+n)/v1);
	ans=min(ans,(n-p2+n)/v2);
	double t1=p1/v1;
	double t2=(n-p2)/v2;
	ans=min(ans,max(t2,(p1+n-(n-p2))/v1));
	ans=min(ans,max(t1,(n-p2+n-p1)/v2));
	//ans=min(ans,(p1+n-p2+n)/(v1+v2));
	ans=min(ans,(n-p1+n)/v1);
	ans=min(ans,(p2+n)/v2);
	double x=(v1*p2+v1*n+v2*p1)/2/(v1+v2);
	if(x>=p1&&x<=p2) ans=min(ans,(2*x-p1)/v1);
	x=(v1*n+v1*p2-v2*p1)/(2*v1+v2);
	if(x>=p1&&x<=p2) ans=min(ans,(x+p1)/v1);
	x=(v1*n+v2*p1-v1*p2+v1*n)/(2*v2+v1);
	if(x>=p1&&x<=p2) ans=min(ans,(2*x-p1)/v1);
	x=(2*v1*n-v1*p2-v2*p1)/(v1+v2);
	if(x>=p1&&x<=p2) ans=min(ans,(x+p1)/v1);
	printf("%.7Lf\n",ans);
	
}

int main()
{
	//ios::sync_with_stdio(0);
	//cin.tie(0),cout.tie(0);
	
	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
	}

	return 0;
}