#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int T,n;
int l[50010],r[50010],a[50010],b[50010],c[50010],x[100010],d[100010],p[100010];
int main(){
    scanf("%d",&T);
    while (T--){
        long long ans=0,Max=0;
        scanf("%d",&n); int t=0; memset(d,0,sizeof(d));
        memset(p,0,sizeof(p));
        for (int i=1; i<=n; i++) scanf("%d%d%d%d%d",&l[i],&r[i],&a[i],&b[i],&c[i]),x[++t]=l[i],x[++t]=r[i];
        sort(x+1,x+1+t);
        for (int i=1; i<=n; i++){
            l[i]=lower_bound(x+1,x+1+t,l[i])-x;
            r[i]=lower_bound(x+1,x+1+t,r[i])-x;
            ans+=c[i];
            d[l[i]]+=a[i]-c[i];
            p[r[i]]+=b[i]-a[i];
        }
        Max=ans; 
        for (int i=1; i<=t; i++){
            ans+=d[i];
            if (ans>Max) Max=ans;
            ans+=p[i];
            if (ans>Max) Max=ans;
        }
        printf("%lld\n",Max);
    }
    return 0;
}