#include <bits/stdc++.h>

int _;

double solve() {
    double n, p1, v1, p2, v2;
    _ = scanf("%lf%lf%lf%lf%lf", &n, &p1, &v1, &p2, &v2);

    if(p1 > p2) std::swap(p1, p2), std::swap(v1, v2);
    p2 = n - p2;
    
    double ans = std::min({
        (n + p1) / v1,
        (n + n - p1) / v1,
        (n + p2) / v2,
        (n + n - p2) / v2,
        std::max((n - p1) / v2, (n - p2) / v1),
    });

    auto check = [&](double T) {
        if(T * v1 < p1 || T * v2 < p2) return false;
        double l1 = std::max(p1 + (T - p1 / v1) * (0.5 * v1), p1 + (T - 2 * p1 / v1) * v1);
        double l2 = std::max(p2 + (T - p2 / v2) * (0.5 * v2), p2 + (T - 2 * p2 / v2) * v2);

        return l1 + l2 >= n;
    };

    double l = 0, r = n * 4000;
    for(_ = 0; _ < 200; ++_) {
        double mid = (l + r) / 2.0;
        if(check(mid)) r = mid;
        else l = mid;
    }

    return std::min(ans, l);
}

int main() {
    int T; _ = scanf("%d", &T); while(T--) printf("%.10lf\n", solve());
    return 0;
}