#include <bits/stdc++.h>
const double S = 0.0000001;
using namespace std;

double walk(double pos, double l, double r, double v)
{
    double ret = (r - l) / v;
    ret += min((r - pos) / v, (pos - l) / v);
    return ret;
}
void solve()
{
    double n, p1, p2, v1, v2;
    cin >> n >> p1 >> v1 >> p2 >> v2;
    if (p1 > p2)
    {
        swap(p1, p2); swap(v1, v2);
    }
    double ans = min(walk(p1, 0.00000000, n, v1), walk(p2, 0.0000000, n, v2));
    double l = p1, r = p2, tmp1, tmp2;
    for (int i = 1; i <= 400; i++)
    {
        double mid = (l + r) / 2.0000000;
        tmp1 = walk(p1, 0, mid, v1); tmp2 = walk(p2, mid, n, v2);
        if (tmp1 >= tmp2) r = mid;
        else l = mid;
    }
    ans = min(ans, min(walk(p1, 0, r, v1), walk(p2, r, n, v2)));
    cout <<fixed<<setprecision(10)<< ans << '\n';
}
int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}