SKYLINE

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<1|1
#define All 1,N,1
#define N 100010
#define read freopen("in.txt", "r", stdin)
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int val[N*4],same[N*4],n,total;
void pushdown(int rt){
    if(same[rt]!=-1){
        same[rt<<1]=same[rt<<1|1]=same[rt];
        val[rt<<1]=val[rt<<1|1]=same[rt];
        same[rt]=-1;
    }
    return;
}
void query(int L,int R,int l,int r,int rt,int v){
    if(same[rt]!=-1&&val[rt]>v)return;
    if(same[rt]!=-1){
        if(L<=l&&R>=r){
            if(v>=val[rt]){
                same[rt]=val[rt]=v;
                total+=(r-l+1);
            }
             return;
        }
    }
    pushdown(rt);
    int m=(l+r)>>1;
    if(L<=m)query(L,R,lson,v);
    if(R>m)query(L,R,rson,v);
}
int main()
{
    int t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        memset(same,0,sizeof(same));
        memset(val,0,sizeof(val));
        int l,r,v;
        total=0;
        while(n--){
            scanf("%d%d%d",&l,&r,&v);
            query(l,r-1,1,N,1,v);
        }
        printf("%d\n",total);
    }
return 0;
}