#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define tests ll test; cin >> test; while(test--)
#define fora(i, x, y) for (ll i = x; i <= y; ++i)
#define ford(i, x, y) for (ll i = x; i >= y; --i)
#define printlst(lst, x, y) fora(i, x, y) cout << lst[i] << " "; cout << endl;
template<typename... T> void inp(T&... args){((cin >> args), ...);}
template<typename... T> void wrt(T... args){((cout << args << " "), ...);}
#define inputlst(lst, x, y) fora(i, x, y) cin >> lst[i]
#define all(lst) lst.begin(), lst.end()
#define sortlst(lst) sort(all(lst))
#define setbits(n) __builtin_popcount(n)
#define sortarr(x, n, y) sort(x, x + n)
typedef pair<ll, ll> pl;
typedef pair<int, int> pi;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef vector<vl> vovl;
typedef vector<vi> vovi;
typedef vector<string> vs;
typedef set<ll> sl;
typedef unordered_map<ll, ll> uml;
typedef map<ll, ll> ml;
int main()
{
    tests
    {
        ll n, k1, k2, w, b;
        inp(n, k1, k2, w, b);
        wrt((min(k1, k2)+abs(k1-k2)/2>=w&&min(n-k1,n-k2)+abs(k1-k2)/2>=b)?"YES\n":"NO\n");
    }
    return 0;
}
