#include<bits/stdc++.h>
#define int long long
#define N 500005
using namespace std;
void solve()
{
    double p1, v1, p2, v2, ans, n;
    cin >> n >> p1 >> v1 >> p2 >> v2;
    if (p1 > p2) {
        swap(p1, p2);
        swap(v1, v2);
    }
    ans = (min(p1, n - p1) + n) / v1;
    ans = min(ans, (min(p2, n - p2) + n) / v2);
    ans = min(ans, (n + p1 + (n - p2)) / (v1 + v2));
    int t1 = (p2 - p1) / (v1 + v2), x = v1 * t1 + p1, x2;
    ans = min({ ans, max(x / v1, (n - x) / v2) + t1, max((n - x) / v1, x / v2) + t1 });
    x = (2 * n * v1 + p1 * v2 - p2 * v1) / (v1 + 2 * v2);
    x2 = (n * v1 + p2 * v1 - p1 * v2) / (2 * v1 + v2);
    ans = min({ ans, (n + p2 - 2 * x2) / v2, (2 * x - p1) / v1 });
    cout<<setiosflags(ios::fixed)<<setprecision(10) << ans << endl;
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}
/*
10
3 1
da/ma/ca/k
da/ma/ca/m
a/b/cc
da/ma/h/c
3 1
da/ma/ca/k
da/ma/ca/m
a/b/cc
da/ma/c
*/