#include<bits/stdc++.h>
using namespace std;

struct node{int x,y;}a[300005];
int n,j,cnt;bool cmp(node u,node v){return u.x<v.x;}
int main(){
    int cas;scanf("%d",&cas);
    while (cas--){
        scanf("%d",&n);int i,l,r,x,y,z;cnt=0;
        for (i=1; i<=n; i++){
            scanf("%d%d%d%d%d",&l,&r,&x,&y,&z);
            swap(x,y);swap(x,z);
            l<<=1;r<<=1;
            a[++cnt]=(node){0,x};a[++cnt]=(node){l,y-x};a[++cnt]=(node){r+1,z-y};
        }
        sort(a+1,a+cnt+1,cmp);long long tmp=0,ans=0;
        for (i=j=1; i<=cnt;i=j){
            for(;j<=cnt&&a[j].x==a[i].x;j++)tmp+=a[j].y;
                if(tmp>ans)ans=tmp;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}