#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define int long long
#define double long double

const int N = 2e5+10;
double INF  = 1e9;
int mod = 1e6+7;
//int mod =  1e9+7;
//int ways[4][2] = {{1,0},{-1,0},{0,1},{0,-1}};

double n,a,b,av,bv,ans;

void solve() {

    cin>>n>>a>>av>>b>>bv;

    if(a > b){
        swap(a,b);
        swap(av,bv);
    }

    double t;

    ans = 1e18l;

    //-> <-
    t = (b-a)/(av+bv);
    ans = min(ans,2.0l*t+max(a/av,(n-b)/bv));
    ans = min(ans,(n+b-a)/(av+bv));

    //<- ->
    ans = min(ans,(a+n-b+n)/(av+bv));

    double tb = (n-b)/bv;
    double ta = a/av;

    if(tb*2.0l > (a+b)/av) ans = min(ans, max(tb,(a+b)/av));
    if(ta*2.0l > (n-b + n-a)/bv) ans = min(ans, max(ta,(n-b + n-a)/bv));

    //<- <-
    ans = min(ans,max(a/av,(b-a+n-a)/bv));

    //-> ->
    ans = min(ans,max((n-b)/bv,(b-a+b)/av));

    ans = min(ans,(a+n)/av);
    ans = min(ans,(n-a+n)/av);
    ans = min(ans,(n-b+n)/bv);
    ans = min(ans,(b+n)/bv);

    cout<<ans<<endl;


}
signed main() {
    std::ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cout<<fixed<<setprecision(10);
    int caset = 1;
    cin>>caset;

    for(int i = 1;i<=caset;i++){
		solve();
	}

    return 0;
}