#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
#define rep(i,s,t) for(int i=s;i<=t;i++)
#define dwn(i,s,t) for(int i=s;i>=t;i--)
using namespace std;
inline int read() {
    int x=0,f=1;char c=getchar();
    for(;!isdigit(c);c=getchar()) if(c=='-') f=-1;
    for(;isdigit(c);c=getchar()) x=x*10+c-'0';
    return x*f;
}
typedef long long ll;
const int maxn=100010;
struct Point {
    int x,val,tp;
    bool operator < (const Point& ths) const {return x<ths.x||(x==ths.x&&tp<ths.tp);}
}A[maxn];
void solve() {
    int n=read();ll cur=0,ans;
    rep(i,1,n) {
        int l=read(),r=read(),a=read(),b=read(),c=read();
        cur+=c;A[i]=(Point){l,a-c,0};A[i+n]=(Point){r,b-a,1};
    }
    ans=cur;n<<=1;
    sort(A+1,A+n+1);
    rep(i,1,n) {
        cur+=A[i].val;
        if(i!=n&&A[i].x==A[i+1].x&&A[i].tp==A[i+1].tp) continue;
        ans=max(ans,cur);
    }
    printf("%I64d\n",ans);
}
int main() {
    dwn(T,read(),1) solve();
    return 0;
}