#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double n, p1, v1, p2, v2;
bool check(double t)
{
    double a = p1;
    double b = p2 - p1;
    double c = n - p2;
    double x1,x2;
    if(t*v1-2*a>=0)
    {
        x1=a+max(t*v1-2*a,(t*v1-a)/2);
    }
    else
    {
        if(t*v1-a>=0)
        {
            x1=a+(t*v1-a)/2;
        }
        else
        {
            x1=0;
        }
    }

    if(t*v2-2*c>=0)
    {
        x2=n-(max(t*v2-2*c,(t*v2-c)/2)+c);
    }
    else
    {
        if(t*v2-c>=0)
        {
            x2=n-((t*v2-c)/2+c);
        }
        else
        {
            x2=n;
        }
    }
    if(x2<=x1)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
void solve()
{
    scanf("%lf %lf %lf %lf %lf", &n, &p1, &v1, &p2, &v2);
    if (p1 > p2)
    {
        swap(p1, p2);
        swap(v1, v2);
    }
    double l = 0, r = 1e8;
    while (r - l > 1e-8)
    {
        double mid = (l + r) / 2;
        if (check(mid))
            r = mid;
        else
            l = mid;
    }
    printf("%.6lf\n", l);
}
int main()
{
    int t = 1;
    scanf("%d", &t);
    while (t--)
        solve();
    return 0;
}