#include <bits/stdc++.h>
using namespace std;
#define ld double
#define ll long long
ld n, p1, v1, p2, v2;
ld js(ld p, ld v, ld l, ld r) { return ((min(p - l, r - p) + (r - l)) / v); }
void solve() {
  cin >> n >> p1 >> v1 >> p2 >> v2;
  if (p1 > p2) {
    swap(v1, v2);
    // ld tp1 = n - p1;
    // ld tp2 = n - p2;
    // p1 = tp1;
    // p2 = tp2;
    swap(p1, p2);
  }
  // cout << p1 << " " << p2 << "\n";
  ld ans = 1e9 + 10;
  // p1
  ans = min(ans, max(js(p1, v1, 0, n), js(p2, v2, 0, n)));
  // cout << ans << "\n";
  // p2
  ans = min(ans, max(js(p1, v1, p1, n), js(p2, v2, 0, p2)));
  // cout << ans << "\n";
  // p3
  ld l = p1, r = p2;
  ll ti = 60;
  while (ti--) {
    ld mid = (l + r) / 2;
    // cout << mid << "\n";
    ld t1 = js(p1, v1, 0, mid);
    ld t2 = js(p2, v2, mid, n);
    // cout << t1 << " " << t2 << "\n";
    ans = min(ans, max(t1, t2));
    // cout << ans << "\n";
    if (t1 < t2)
      l = mid;
    else
      r = mid;
  }
  cout << fixed << setprecision(12) << ans << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
}