#include<iostream>
#include<cstdio>
#include<fstream>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#define MAXN 50005
using namespace std;

struct flower
{
    int minv;
    int maxv;
    int a;
    int b;
    int c;
};

struct incident
{
    int temp;
    int f;
    int type;
};

int T,N;

flower f[MAXN];
incident b[2*MAXN];

void discret()
{
    for(int i=1;i<=N;i++)
    {
        b[i*2-1].temp=f[i].minv;
        b[i*2-1].type=1;
        b[i*2-1].f=b[i*2].f=i;
        b[i*2].temp=f[i].maxv;
        b[i*2].type=2;
    }
}

bool mycmp(incident x,incident y)
{
    if(x.temp<y.temp)return 1;
    return 0;
}

void solve()
{
    scanf("%d",&T);
    while(T--)
    {
        long long best;
        long long ans=0;
        scanf("%d",&N);
        for(int i=1;i<=N;i++)
        {
            scanf("%d%d%d%d%d",&f[i].minv,&f[i].maxv,&f[i].a,&f[i].b,&f[i].c);
            f[i].minv=f[i].minv*2;
            f[i].maxv=f[i].maxv*2+1;
            ans+=f[i].c;
        }

        best=ans;
        discret();

        sort(b+1,b+N+N+1,mycmp);

        //printf("%d %d %d\n",b[1].temp,b[1].f,b[1].type);

        int now=1;
        while(now<=2*N)
        {
            int temp=b[now].temp;
            int j=now;
            while(b[j].temp==temp)
            {
                if(b[j].type==1)ans=ans-f[b[j].f].c+f[b[j].f].a;
                else ans=ans-f[b[j].f].a+f[b[j].f].b;
                j++;
            }

            now=j;
            if(ans>best)best=ans;
        }

        printf("%lld\n",best);

    }
}

int main()
{
    //freopen("1002.in","r",stdin);
    //freopen("1002.out","w",stdout);
    solve();
    return 0;
}