#include <bits/stdc++.h>
#define ll long long
using namespace std;

int t;
double n,p1,v1,p2,v2;
void solve(){
    scanf("%lf%lf%lf%lf%lf",&n,&p1,&v1,&p2,&v2);
//    cin>>n>>p1>>v1>>p2>>v2;
    if(p1>=p2){
        swap(p1,p2);
        swap(v1,v2);
    }
    double t1,t2,t3,t4;
    t1=(p1+2*n-p2)/(v1+v2);
    if(p1>0&&p2<n){
        t2=min((2*n-p1)/v1,(2*n-p2)/v2);
    }
    else if(p1==0){
        double tp=(p2-p1)/v1;
        if(v2*tp>=n-p2){
            t2=min(tp,(2*n-p2)/(v1+v2));
        }
        else{
            t2=min(n/v1,(n-p2)/v2);
        }
    }
    if(p1>0&&p2<n){
        t3=min((n+p1)/v1,(p2+n)/v2);
    }
    else if(p2==n){
        double tp=(p2-p1)/v2;
        if(v1*tp>=p1){
            t3=min(tp,(n+p1)/(v1+v2));
        }
        else{
            t3=min(p2/v2,(p1)/v1);
        }
    }
    if(p1>0&&p2<n){
        t4=max(min((2*n-p1)/v1,p2/v2),min((n-p1)/v1,(n+p2)/v2));
    }
    else if(p1==0&&p2==n){
        t4=n/(v1+v2);
    }
    else if(p1==0){
        t4=min(n/v1,(n+p2)/v2);
    }
    else if(p2==n){
        t4=min((2*n-p1)/v1,p2/v2);
    }
//    cout<<t1<<"\n"<<t2<<"\n"<<t3<<"\n"<<t4<<"\n";
    printf("%.10lf\n",min({t1,t2,t3,t4}));
}

int main(){
//    ios::sync_with_stdio(false);
//    cin.tie(0);
//    cout.tie(0);
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}