#include<bits/stdc++.h>
using namespace std;
const long double eps=1e-8;
long double p1,v1,p2,v2,n;
bool check(long double x){
	long double s1=v1*x,s2=v2*x;
	bool ans=0;
	ans=ans||(s1+eps>p1+n)||(s1+eps>2*n-p1)
		   ||(s2+eps>p2+n)||(s2+eps>2*n-p2);
	
	//ll
	if(s1+eps>p1){
		if(s1-eps<2*p1){
			ans=ans||(s2+eps>p2-p1+n-p1);
		}
		else{
			long double t=min(s1-2*p1,p2-p1);
			ans=ans||(s2+eps>p2-p1-t+n-p1-t);		
		}
	}
	
	//rr
	if(s2+eps>n-p2){
		if(s2-eps<2*(n-p2)){
			ans=ans||(s1+eps>p2-p1+p2);
		}
		else{
			long double t=min(s2-2*(n-p2),p2-p1);
			ans=ans||(s1+eps>p2-p1-t+p2-t);
		}
	}  
	
	//rl
	ans=ans||(s1+eps>n-p1&&s2+eps>p2);
	long double t=(p2-p1)/(v2+v1);
	ans=ans||(s1+eps>v1*t*2+p1&&s2+eps>v2*t*2+n-p2);
	
	//lr
	if(s1+eps>p1&&s2+eps>n-p2){
		if(s1+eps>2*p1){
			long double t=min(s1-2*p1,p2-p1);
			ans=ans||(s2+eps>n-p2+n-p1-t);
		}
		else{
			ans=ans||(s2+eps>n-p2+n-p1);
		}
	}
	return ans;
}
void solve(){
	cin>>n>>p1>>v1>>p2>>v2;
	if(p1>p2){
		swap(p1,p2);
		swap(v1,v2);
	}
	long double l=0,r=2e7,ans;
	while(r-l>eps){
		long double mid=(l+r)/2;
	//	cout<<mid<<endl;	
		if(check(mid)){
			r=mid;
			ans=mid;
		}
		else
			l=mid;
	}
	printf("%.7Lf\n",ans);
}
int main(){
	int T;
	cin>>T;
	while(T--){
		solve();
	}
}