#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define MAXN 50010
#define ll long long
using namespace std;
struct event{
    double time;
    int delta_value;
}e[MAXN*3+1];
bool cmp(const event &a,const event &b)
{
    return a.time<b.time;
}
int T,L,R,a,b,c,top;
ll ans,final;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        int n;scanf("%d",&n);
        final=top=ans=0;
        for(int i=1;i<=n;i++)
        {
            scanf("%d%d%d%d%d",&L,&R,&a,&b,&c);
            top++;
            e[top].time=L;
            e[top].delta_value=a-c;
            top++;
            e[top].time=(double)R+0.5;
            e[top].delta_value=b-a;
            ans+=c;
        }
        sort(e+1,e+top+1,cmp);
        final=ans;
        for(int i=1;i<=top;i++)
        {
            while(i+1<=top&&fabs(e[i].time-e[i+1].time)<0.1)
            {
                e[i+1].delta_value+=e[i].delta_value;
                i++;
            }
            ans+=e[i].delta_value;
            if(ans>final) final=ans;
        }
        printf("%I64d\n",final);
    }
    return 0;
}