#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e3 + 5;
int a[N];
void solve() {
    int n;
    cin >> n;
    int px, py, qx, qy;
    cin >> px >> py >> qx >> qy;
    int sum = 0;
    int max_a = 0;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        sum += a[i];
        max_a = max(max_a, a[i]);
    }
    int dx = px - qx;
    int dy = py - qy;
    double D = sqrt(dx * dx + dy * dy);
    double min_dist = max(0LL, 2 * max_a - sum);
    if (min_dist <= D && D <= sum) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
}
 
signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
 
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgaW50IGxvbmcgbG9uZwpjb25zdCBpbnQgTiA9IDFlMyArIDU7CmludCBhW05dOwp2b2lkIHNvbHZlKCkgewogICAgaW50IG47CiAgICBjaW4gPj4gbjsKICAgIGludCBweCwgcHksIHF4LCBxeTsKICAgIGNpbiA+PiBweCA+PiBweSA+PiBxeCA+PiBxeTsKICAgIGludCBzdW0gPSAwOwogICAgaW50IG1heF9hID0gMDsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IG47ICsraSkgewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgICAgIHN1bSArPSBhW2ldOwogICAgICAgIG1heF9hID0gbWF4KG1heF9hLCBhW2ldKTsKICAgIH0KICAgIGludCBkeCA9IHB4IC0gcXg7CiAgICBpbnQgZHkgPSBweSAtIHF5OwogICAgZG91YmxlIEQgPSBzcXJ0KGR4ICogZHggKyBkeSAqIGR5KTsKICAgIGRvdWJsZSBtaW5fZGlzdCA9IG1heCgwTEwsIDIgKiBtYXhfYSAtIHN1bSk7CiAgICBpZiAobWluX2Rpc3QgPD0gRCAmJiBEIDw9IHN1bSkgewogICAgICAgIGNvdXQgPDwgIlllc1xuIjsKICAgIH0gZWxzZSB7CiAgICAgICAgY291dCA8PCAiTm9cbiI7CiAgICB9Cn0KCnNpZ25lZCBtYWluKCkgewogICAgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7CiAgICBjaW4udGllKDApOyBjb3V0LnRpZSgwKTsKCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHNvbHZlKCk7CiAgICB9Cn0K

NQoyCjEgMSA1IDEKMyAzCjMKMSAxIDMgMwoyIDMgNAoyCjEwMCAxMDAgMTAwIDEwMAo0IDUKMQo1IDEgMSA0CjUKMgoxMDAwMDAwMCAxMDAwMDAwMCAxMDAwMDAwMCAxMDAwMDAwMAoxMDAwMCAxMDAwMAo=

5
2
1 1 5 1
3 3
3
1 1 3 3
2 3 4
2
100 100 100 100
4 5
1
5 1 1 4
5
2
10000000 10000000 10000000 10000000
10000 10000