#include<bits/stdc++.h>
using namespace std;
int T;
double n,p1,v1,p2,v2,ans;

int main(){
	cin>>T;
	while(T--){
		scanf("%lf%lf%lf%lf%lf",&n,&p1,&v1,&p2,&v2);
		if (p1>p2){
			swap(p1,p2);
			swap(v1,v2);
		}
		ans = min(min((min(p1,n-p1)+n)/v1,(min(p2,n-p2)+n)/v2),
					max((n-p1)/v1,p2/v2));
		double l = 0,r = 1e9,t3=1e9;
	for(int i=1;i<=100;++i){
			double t = (r+l)/2;
			double s = v1*t+v2*t;
			//v1*t
			double lef=max(v1*t-2*p1,(v1*t-p1)/2),rig=max(v2*t-2*(n-p2),(v2*t-(n-p2))/2);//使t时间内a在p12间跑的与b在p12间跑的最大 
			if(lef+rig>=p2-p1)r=t,t3=t;//如果可覆盖 
			else l=t;
		}
		printf("%.10lf\n",min(ans,t3));
	}
}