//   Author:Arturia
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<ctime>
#include<cstdlib>
#include<string>
#include<queue>
#include<cmath>
#include<set>
#include<map>
#include<bitset>
#include<vector>
#define rep(x,a,b) for (int x=a;x<=(int)b;x++)
#define drp(x,a,b) for (int x=a;x>=(int)b;x--)
#define cross(x,a) for (int x=hd[a];~x;x=nx[x])
#define ll long long
#define inf (1<<29)
#define PII pair<int,int>
#define PDD pair<double,double>
#define mk(a,b) make_pair(a,b)
#define fs first
#define sc second
#define pb push_back
#define VI vector<int>
#define VS vector<string>
#define MC(a,b) memcpy(a,b,sizeof b)
#define MS(a,b) memset(a,b,sizeof a)
using namespace std;
inline ll rd(){
    ll x=0;int ch=getchar(),f=1;
    while (!isdigit(ch)&&(ch!='-')&&(ch!=EOF)) ch=getchar();
    if (ch=='-'){f=-1;ch=getchar();}
    while (isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
    return x*f;
}
inline void rt(ll x){
    if (x<0) putchar('-'),x=-x;
    if (x>=10) rt(x/10),putchar(x%10+'0');
        else putchar(x+'0');
}
const int maxn=50005;
struct plant{
    int l,r,a,b,c;
    bool operator <(const plant&x)const{return r==x.r?l<x.l:r<x.r;}
}a[maxn],b[maxn];
bool cmp(const plant&a,const plant&b){return a.l==b.l?a.r<b.r:a.l<b.l;}
int n;
int main(){
    for (int T=rd();T--;){
        n=rd();
        rep(i,1,n) a[i].l=rd(),a[i].r=rd(),a[i].b=rd(),a[i].c=rd(),a[i].a=rd();
        memcpy(b,a,sizeof a);
        sort(a+1,a+n+1,cmp);sort(b+1,b+n+1);
        ll ans=0,suma=0,sumb=0,sumc=0;
        rep(i,1,n) suma+=a[i].a;
        ans=suma;
        int j=1;
        rep(i,1,n){
            sumb+=a[i].b,suma-=a[i].a;
            ans=max(ans,suma+sumb+sumc);
            int k=j-1;while (k<n&&b[k+1].r<a[i+1].l) k++;
            rep(l,j,k){
                sumc+=b[l].c,sumb-=b[l].b;
                while (l<k&&b[l+1].r==b[l].r) l++,sumc+=b[l].c,sumb-=b[l].b;
                ans=max(ans,suma+sumb+sumc);
            }
            j=k+1;
        }
        rep(l,j,n){
            sumc+=b[l].c,sumb-=b[l].b;
            while (l<n&&b[l+1].r==b[l].r) l++,sumc+=b[l].c,sumb-=b[l].b;
            ans=max(ans,suma+sumb+sumc);
        }
        rt(ans),putchar('\n');
    }
}