#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>
#include <omp.h>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;
typedef pair<long long int, pll> lpll;

const long long int mod = 1000000007;
const long long int INF = 1e18;
const long double PI=3.14159265358979323; 
//const long long int pl=1000000;

long long int res=0,T,N,K[200200],L[200200],R[200200];
vector<long long int>Lteam[200200],Rteam[200200];
priority_queue<long long int>pq;
int main(){

    cout << fixed << setprecision(18);
    cin>>T;
    for(long long int i = 0; i < T; i++){
        cin>>N;
        res=0;
        long long int Lsize=0,Rsize=0;
        for(long long int i = 0; i <= N; i++){
            Lteam[i].clear();
            Rteam[i].clear();
        }
        for(long long int j = 0; j < N; j++){
            cin>>K[j]>>L[j]>>R[j];
            if(L[j]>=R[j]){
                Lteam[K[j]].push_back(L[j]-R[j]);
                Lsize++;
                res+=R[j];
            }else{
                Rteam[N-K[j]].push_back(-L[j]+R[j]);
                Rsize++;
                res+=L[j];
            }
        }
        for(long long int j = Lsize+1; j <= N; j++){
            for(long long int k = 0; k < Lteam[j].size(); k++){
                pq.push(Lteam[j][k]);
            }
        }

        for(long long int j = Lsize; j >=1 ; j--){
            for(long long int k = 0; k < Lteam[j].size(); k++){
                pq.push(Lteam[j][k]);
            }
            if(!pq.empty()){res+=pq.top();pq.pop();}
        }
        while (!pq.empty())
        {
            pq.pop();
        }

        for(long long int j = Rsize+1; j <= N; j++){
            for(long long int k = 0; k < Rteam[j].size(); k++){
                pq.push(Rteam[j][k]);
            }
        }

        for(long long int j = Rsize; j >=1 ; j--){
            for(long long int k = 0; k < Rteam[j].size(); k++){
                pq.push(Rteam[j][k]);
            }
            if(!pq.empty()){res+=pq.top();pq.pop();}
        }
        while (!pq.empty())
        {
            pq.pop();
        }
        cout<<res<<endl;
        

    }
    
    
}



Measured memory_bytes: 22992