#include<bits/stdc++.h>

#define ll  long long
#define ull unsigned long long
#define ld long double
#define pii pair<ll,ll>
using namespace std;
#pragma GCC optimize(3)
#define N 100005
struct Node
{
    vector<string> s;
    vector<int> type;
    vector<int> e;
};
ll tot=1;
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    // freopen("")
    int T;
    cin>>T;
    while(T--)
    {
        ld n,p1,p2,v1,v2;
        cin>>n>>p1>>v1>>p2>>v2;
        if(p1>p2)
        {
            swap(p1,p2);
            swap(v1,v2);
        }
        ld ans=(n+min(p1,n-p1))/v1;
        ld t2=(n+min(p2,n-p2))/v2;
        ans=min(ans,t2);
        ld t3=(n*2+p1-p2)/(v1+v2);
        ans=min(t3,ans);
        ld t4=max(p1/v1,(n-p2+n-p1)/v2);
        ans=min(ans,t4);
        ld t5=max((n-p2)/v2,(p1+p2)/v1);
        ans=min(ans,t5);
        ld t6=max(p2/v2,(n-p1)/v1);
        ans=min(ans,t6);
        ld t7=max((n+p2-p1)/(v2+v1),max(p1/v1,(n-p2)/v2));
        ans=min(t7,ans);
        ld t8=max(p1/v1,(n+p2-p1-p1)/v2);
        ans=min(ans,t8);
        ld t9=max((n-p2)/v2,((p2+p2-p1)/v1));
        ans=min(ans,t9);
        cerr<<ans<<endl;
        ld x=(v2*(p1+p2)-v1*(n-p2))/(v1*2+v2);
        if(x>=0&&x<=p2-p1)
        {
            ld tt=(x*2+n-p2)/v2;
            ans=min(ans,tt);
        }
        cerr<<ans;
        ld y=(v1*(n*2-p1-p2)-v2*p1)/(v1+v2*2);
        if(y>=0&&y<=p2-p1)
        {
            ld tt=(y*2+p1)/v1;
            ans=min(ans,tt);
        }
        cout<<setprecision(15)<<ans<<endl;
    }
    return 0;
}