#include <bits/stdc++.h>

#define int long long

using namespace std;

void solve() {
    double n, p1, p2, v1, v2;
    std::cin >> n >> p1 >> v1 >> p2 >> v2;

    if(p1 > p2) {
        std::swap(p1, p2);
        std::swap(v1, v2);
    }

    auto check1 = [&](double ti, double p1, double v1, double p2, double v2) {
        double l1 = p1, r1 = p1, l2 = p2, r2 = p2;
        // 1左1右
        double t = ti;
        double t1 = p1 / v1;
        if(t1 >= t) l1 -= v1 * t;
        else {
            l1 = 0.;
            t -= t1;
            r1 = std::max(r1, t * v1);
            r1 = std::min(r1, n);
        }
        t = ti;
        double t2 = (n - p2) / v2;
        if(t2 >= t) r2 += v2 * t;
        else {
            r2 = n;
            t -= t2;
            l2 = std::min(l2, n - t * v2);
            l2 = std::max(l2, 0.);
        }
        if(r1 - l1 >= n || r2 - l2 >= n || (l1 == 0 && r2 == n && l2 <= r1)) return true;
        return false;
    };

    auto check = [&](double ti) -> bool {
        if((n + std::min(p1, n - p1)) / v1 <= ti) return true;
        if((n + std::min(p2, n - p2)) / v2 <= ti) return true;
        if(check1(ti, p1, v1, p2, v2)) return true;
        double t = (p2 - p1) / (v1 + v2);
        if(ti >= t) {
            if(p1 == 0 && p2 == n) return true;
            double x = p1 + v1 * t;
            if(check1(ti - t, x, v1, x, v2)) return true;
        }

        return false;
    };

    double l = 0, r = 20000000;
    for(int i = 0; i < 200; i++) {
//        std::cout << l << ' ' << r << '\n';
        double mid = (l + r) / 2.;
        if(check(mid)) r = mid;
        else l = mid;
    }
//    printf("%.10f %.10f\n", l, r);
    printf("%.10f\n", r);
}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t = 1;
    std::cin >> t;
    for(int i = 0; i < t; ++i) {
        solve();
    }

    return 0;
}