#include <stdio.h>
#include <algorithm>

using namespace std;

//long long
const long long maxn = 51000;
struct so {
    double t;
    long long x;
} s[maxn * 5];
long long top;
long long n;
long long sum , ans;
bool cmp ( so x1 , so x2 ) {
    if ( x1.t == x2.t ) return x1.x < x2.x;
    return x1.t < x2.t;
}
void work () {
    //clear ();
    long long i , l , r , a , b , c;
    scanf ( "%I64d" , &n );
    sum = ans = 0;
    top = 0;
    for ( i = 1 ; i <= n ; i++ ) {
        scanf ( "%I64d%I64d%I64d%I64d%I64d" , &l , &r , &a , &b , &c );
        swap ( a , b ); swap ( a , c );
        sum += a;
        s[++top].t = l; s[top].x = b - a;
        s[++top].t = double (r) + 0.5; s[top].x = c - b;
    }
    sort ( s + 1 , s + 1 + top , cmp );
    for ( i = 1 ; i <= top ; i++ ) {
        ans = max ( ans , sum );
        sum += s[i].x;
        //printf ( "%d\n" , s[i].x );
    }
    ans = max ( ans , sum );
    printf ( "%I64d\n" , ans );
}
int main () {
    int t;
    scanf ( "%d" , &t );
    while ( t-- ) work ();
    return 0;
}