#include<bits/stdc++.h>
#include<bits/extc++.h>

using namespace std;

template<typename T>
void read(T &x){
    x = 0;
    bool f = 0;
    char c = getchar();
    while(c < '0' || c > '9'){
        f |= (c == '-');
        c = getchar();
    }
    while('0' <= c && c <= '9'){
        x = x*10+c-'0';
        c = getchar();
    }
    if(f) x = -x;
}

const int N = 2e5+9;

int Tid;
int n;
int a[N], b[N];
int aa[N], bb[N];
int fx[N];
long long t[N];
long long tt[N];
int sx[N];
bool ok;
long long nw;

priority_queue<pair<long long, int> > q1;
__gnu_pbds::tree<pair<int, int>, __gnu_pbds::null_type> za;
// unordered_map<int, int> dy;

int hd[N], tl[N], nxt[N], pre[N];
int lsiz[N];

int main(){

    freopen("move.in", "r", stdin);
    freopen("move.out", "w", stdout);

    read(Tid);
    int T = 0;
    read(T);
    while(T--){
        // dy.clear();
        za.clear();
        while(!q1.empty()) q1.pop();
        for(int i = 1; i <= n; i++){
            hd[i] = tl[i] = nxt[i] = pre[i] = 0;
            lsiz[i] = 0;
        }
        read(n);
        for(int i = 1; i <= n; i++){
            read(aa[i]); read(bb[i]); read(tt[i]);
            a[i] = aa[i];
            b[i] = bb[i];
            t[i] = tt[i];
            if(a[i] <= b[i]){
                fx[i] = 1;
            }else{
                fx[i] = -1;
            }
        }
        for(int i = 1; i <= n; ){
            if(fx[i] == 1){
                i++;
                continue;
            }
            int j = i;
            while(j < n && fx[j+1] == -1){
                j++;
            }
            long long x = b[i], y = a[j];
            for(int k = i; k <= j; k++){
                a[k] = x+y-aa[i+j-k];
                b[k] = x+y-bb[i+j-k];
                t[k] = tt[i+j-k];
            }
            i = j+1;
        }
        ok = 1;
        nw = 2e16;
        for(int i = 1; i <= n; i++){
            za.insert({b[i], b[i]});
            q1.push({t[i], i});
            hd[i] = tl[i] = i;
            // dy[b[i]] = i;
            lsiz[i] = 1;
        }
        while(!q1.empty()){
            int x = q1.top().second;
            nw = min(nw, q1.top().first);
            q1.pop();
            auto at = za.lower_bound({b[x], 0});
            if(at == za.begin()){
                for(int j = 0, k = hd[x]; k; j++, k = nxt[k]){
                    nw -= j+b[x]-a[k];
                }
                za.erase(at);
                continue;
            }else{
                auto at2 = at;
                --at2;
                if(((*at2).second < a[x])){
                    for(int j = 0, k = hd[x]; k; j++, k = nxt[k]){
                        nw -= j+b[x]-a[k];
                    }
                    za.erase(at);
                    continue;
                }
                pair<int, int> tp = *at2;
                za.erase(at);
                za.erase(za.find(tp));
                while(lsiz[x] && tp.second+lsiz[x]-1 < a[tl[x]]){
                    nw -= lsiz[x]-1+b[x]-a[tl[x]];
                    lsiz[x]--;
                    tl[x] = pre[tl[x]];
                    nxt[tl[x]] = 0;
                }
                nw -= (b[x]-tp.second-1ll) * lsiz[x];
                // int pos = dy[tp.first];
                int pos = lower_bound(b+1, b+1+n, tp.first)-b;
                if(lsiz[x]){
                    tp.second += lsiz[x];
                    pre[hd[x]] = tl[pos];
                    nxt[tl[pos]] = hd[x];
                    lsiz[pos] += lsiz[x];
                    tl[pos] = tl[x];
                }
                // dy[b[x]] = 0;

                za.insert(tp);
            }
                    
        }
        if(nw >= 0 && ok){
            puts("Yes");
        }else{
            puts("No");
        }
    }

    return 0;
}