#include <bits/stdc++.h>
using namespace std;
//fabs、sqrtl
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define int long long
#define db 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
void solve(){
	double n,p1,v1,p2,v2;
    cin>>n>>p1>>v1>>p2>>v2;
    //第一种往两边走
    if(p1>p2){
        swap(p1,p2);
        swap(v1,v2);
    }//cout<<p1<<"!"<<p2<<"!!";
    double t1=p1/v1;
    double t2=(n-p2)/v2;
    double t=0;
    if(t2<t1){
        t+=t2;
        if(n/v2<=(p1-v1*t2)/v1) t+=n/v2;
        else{
            if(v2*(p1-v1*t2)/v1>=n-p1){
                t+=(p1-v1*t2)/v1;
            }else{
                t+=(p1-v1*t2)/v1;
                t+=min((n-(p1-v1*t2)/v1*v2-p1)/v2,min(min(p2,n-v2*(p1-v1*t2)/v1)/v1,(n-(p1-v1*t2)/v1*v2)/(v1+v2)));
            }
        }
    }else if(t1==t2){
        t+=t1;
        t+=min(p2/v1,min(n/(v1+v2),(n-p1)/v2));
    }else{
        t+=t1;
        if(n/v1<=(n-p2-v2*t1)/v2) t+=n/v1;
        else{
            if(v1*(n-p2-v2*t1)/v2>=p2){
                t+=(n-p2-v2*t1)/v2;
            }else{
                t+=(n-p2-v2*t1)/v2;
                t+=min((n-(n-p2-v2*t1)/v2*v1)/(v1+v2),min(min(n-p1,n-(n-p2-v2*t1)/v2*v1)/v2,((n-p2-(n-p2-v2*t1)/v2*v1)/v1)));
            }
        }
    }
    //第二种一个人走完全程
    double tt=0;
    tt=min((min(p2,n-p2)+n)/v2,(min(p1,n-p1)+n)/v1);
    //cout<<min(t,tt)<<"!"<<endl;
    //第三种两人同向走
    double ttt=0;
    //cout<<(n-p1)/v1<<"!"<<(n-p2/v2)<<endl;
    ttt=max((n-p1)/v1,(n-p2)/v2);
    ttt=min(ttt,(p2-p1)/(v1+v2)+max(p1/v1,p2/v2));
    //cout<<ttt<<"!";
    t=min(t,min(tt,ttt));
    cout<<fixed<<setprecision(16)<<endl;
    cout<<t<<endl;
}
signed main(){
	int T=1;
	cin>>T;
	while(T--)
	{
		solve();
    }
	return 0;
}