#include<cstdio>

#include<algorithm>

#include<cmath>

#include<cstring>

#include<cctype>

#include<iostream>

using namespace std;

const int inf=0x3f3f3f3f,maxn=;

struct cyc{int x,y;}a[maxn*];

long long ans,sum;

int n,A,B,C,D,E,cnt;

bool cmp(cyc a,cyc b)

{return a.x<b.x;}

int read()

{

    int x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

int main()

{

    int T=read();

    while(T--)

     {

         int n=read();sum=,cnt=;

         for(int i=;i<=n;i++)

          {

              A=read(),B=read(),C=read(),D=read(),E=read();A*=;B*=;

              sum+=E;

              a[++cnt].x=A,a[cnt].y=C-E;a[++cnt].x=B+,a[cnt].y=D-C;

         }

        sort(a+,a+cnt+,cmp);

        ans=sum;

        for(int i=,now=;i<=cnt;i++)

         {

             while(now<=cnt&&a[now].x==a[i].x){sum+=a[now].y;now++;}

             ans=max(ans,sum);

         }

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

     }

    return ;

}