#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int,int>PII;
int T,n;
vector<PII>vec;
int main()
{
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        int l,r,a,b,c;
        vec.clear();
        while(n--)
        {
            scanf("%d%d%d%d%d",&l,&r,&a,&b,&c);
            if(l>1)
            {
                vec.push_back(PII(2,c));
                vec.push_back(PII(l<<1,a-c));
            }
            else vec.push_back(PII(2,a));
            vec.push_back(PII(r<<1|1,b-a));
        }
        sort(vec.begin(),vec.end());
        LL sum=0,ans=0;
        for(vector<PII>::iterator it=vec.begin();it!=vec.end();++it)
            sum+=it->second,ans=max(ans,sum);
        printf("%I64d\n",ans);
    }
    return 0;
}