#include <bits/stdc++.h>
using namespace std;
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define int long long
#define double long double
#define PII pair<int,int>
#define For(i,a,n) for(int i=a;i<=n;i++)
#define rof(i,n,a) for(int i=n;i>=a;i--)
#define eps 1e-9
const int N=505,M=505;//点，边 
const int mod=998244353,INF=0x3f3f3f3f;//1e9+7,int
double n,p1,v1,p2,v2;
double ok(double t){
    double d1=max((t-p1/v1)*v1/2,(t-2*p1/v1)*v1);
    double d2=max((t-(n-p2)/v2)/2*v2,(t-2*(n-p2)/v2)*v2);
    if(d1<=0||d2<=0) return false;
    if(d1+d2>=p2-p1) return true;
    else return false;
}
void solve(){
    cin>>n>>p1>>v1>>p2>>v2;
    if(p1>p2){
        swap(p1,p2);
        swap(v1,v2);
    }
    double t=0;
    t=min((min(n-p2,p2)+n)/v2,(min(n-p1,p1)+n)/v1);
    t=min(t,max((n-p1)/v1,(p2/v2)));
    double l=0;
    double r=1e18;
    double mid=0;
    while(r-l>eps){
        mid=(l+r)/2;
        if(ok(mid)){
            t=min(t,mid);
            r=mid;
        }else{
            l=mid;
        }
    }
    cout<<fixed<<setprecision(16)<<endl;
    cout<<t<<endl;
}
signed main(){
	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
    }
	return 0;
}