#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;

double abs2(double a) { return a < 0 ? -a : a; }
double max(double a, double b) { return a > b ? a : b; }
double min(double a, double b) { return a < b ? a : b; }
double n, p1, p2, v1, v2, t, minn, p;

void solve()
{
    cin >> n >> p1 >> v1 >> p2 >> v2;
    if (p2 < p1)
    {
        t = p1;
        p1 = p2;
        p2 = t;
        t = v1;
        v1 = v2;
        v2 = t;
    }
    minn = min(min((p1 + n) / v1, (n * 2 - p1) / v1), min((p2 + n) / v2, (n * 2 - p2) / v2));
    p = (p2 * v1 + n * v1 - p1 * v2) / (2 * v1 + v2);
    if (p1 <= p && p <= p2)
    {
        minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    }
    p = (p2 * v1 + n * v1 + p1 * v2) / (2 * v1 + 2 * v2);
    if (p1 <= p && p <= p2)
    {
        minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    }
    p = (0 - p1 * v2 + 2 * n * v1 - p2 * v1) / (v1 + v2);
    if (p1 <= p && p <= p2)
    {
        minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    }
    p = (p1 * v2 + 2 * n * v1 - p2 * v1) / (v1 + 2 * v2);
    if (p1 <= p && p <= p2)
    {
        minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    }
    p = p1;
    minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    p = p2;
    minn = min(minn, max(min((p + p1) / v1, (p * 2 - p1) / v1), min((n + p2 - p * 2) / v2, (n * 2 - p - p2) / v2)));
    cout << fixed << setprecision(10) << minn << '\n';
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}
// (p*2-p1)/v1==(2*n-p-p2)/v2
// p*(2/v1+1/v2)==(2*n-p2)/v2+p1/v1
// (p+p1)/v1==(p2+n-2*p)/v2
// p*(1/v1+2/v2)==(p2+n)/v2+p1/v1