#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 = 4e18l;

    ans = min(ans,(n + n - a) / av);
    ans = min(ans,(n + n - b) / bv);
    
    ans = min(ans,(a + n) / av);
    ans = min(ans,(b + n) / bv);
    
    t = (b - a) / (av + bv);
    
    ans = min(ans,t + max((a + t * av) / av,(n - b + t * bv) / bv));
    ans = min(ans,t + max((n - b + t * bv) / av,(a + t * av) / bv));
    
    ans = min(ans,max((n - b) / bv,(b + a) / av));
    ans = min(ans,max(a / av,(n - b + n - a) / bv));
    
    ans = min(ans,max((n - b) / bv,(b - a + b - a + a) / av));
    ans = min(ans,max(a / av,(b - a + b - a + n - b) / bv));
    
    if(a / av > (n - b) / bv)
    {
    	double tt = a / av;
    	double x = tt * bv - (n - b);
    	ans = min(ans,tt + (n - x) / (av + bv));
	}else
	{
		double tt = (n - b) / bv;
		double x = tt * av - a;
		ans = min(ans,tt + (n - x) / (av + 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;
}