#pragma region template 2.4
#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq_asc = priority_queue<T, vector<T>, greater<T>>;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef pair<ll, ll> ii;
typedef vector<ii> vii;
typedef vector<string> vs;
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP1(i, n) for (ll i = 1; i <= (n); ++i)
#define FOR(i, a) for (auto &i : a)
#define CH(f, x, y) x = f(x, y)
#define IN(T, x) \
    T x;         \
    cin >> x;
#define AIN(T, a, n) \
    vector<T> a(n);  \
    FOR(i, a)        \
    cin >> i;
#define A2IN(T1, a, T2, b, n) \
    vector<T1> a(n);          \
    vector<T2> b(n);          \
    REP(i, n)                 \
    cin >> a[i] >> b[i];
#define OUT(x) cout << (x) << endl;
#define FOUT(x) cout << fixed << setprecision(15) << (x) << endl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(a) sort(ALL(a))
#define RSORT(a) \
    SORT(a);     \
    reverse(ALL(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define DUMPA(a)          \
    cout << #a << " = {"; \
    JOUT(ALL(a), ", ", cout) << "}" << endl;

template <typename T>
ostream &JOUT(T s, T e, string sep = " ", ostream &os = cout)
{
    if (s != e)
    {
        os << *s;
        ++s;
    }
    while (s != e)
    {
        os << sep << *s;
        ++s;
    }
    return os;
}

ostream &YES(bool cond, string yes = "Yes", string no = "No", ostream &os = cout)
{
    if (cond)
    {
        os << yes << endl;
    }
    else
    {
        os << no << endl;
    }
    return os;
}

template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p)
{
    os << '(' << p.first << ", " << p.second << ')';
    return os;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v)
{
    os << '[';
    JOUT(ALL(v), ", ", os) << ']';
    return os;
}

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#pragma endregion template
#pragma region bit 1.0
template <typename T>
struct bit
{
    ll n;
    vector<T> a;

    bit() {}

    bit(ll n) : n(n)
    {
        a.assign(n + 1, 0);
    }

    void add(ll i, T x)
    {
        ++i;
        while (i <= n)
        {
            a[i] += x;
            i += i & -i;
        }
    }

    T sum(ll i)
    {
        T s = 0;
        while (i > 0)
        {
            s += a[i];
            i -= i & -i;
        }
        return s;
    }
};
#pragma endregion bit

int main()
{
    IN(ll, T);
    REP(t, T)
    {
        IN(ll, N);
        vi K(N), L(N), R(N);
        REP(i, N)
        {
            cin >> K[i] >> L[i] >> R[i];
        }
        ll ans = 0;
        ll p = 0;
        ll q = 0;
        vii P, Q;
        REP(i, N)
        {
            ans += min(L[i], R[i]);
            if (L[i] > R[i])
            {
                ++p;
            }
            else if (L[i] < R[i] and K[i] < N)
            {
                ++q;
            }
        }
        REP(i, N)
        {
            if (L[i] > R[i])
            {
                P.push_back({L[i] - R[i], min(p, K[i])});
            }
            else if (L[i] < R[i] and K[i] < N)
            {
                Q.push_back({R[i] - L[i], min(q, N - K[i])});
            }
        }
        RSORT(P);
        RSORT(Q);
        // DUMP(P);
        // DUMP(Q);
        // bit<ll> Cp(p + 2);
        // bit<ll> Cq(q + 2);
        set<ll> Cp, Cq;
        Cp.insert(0);
        Cq.insert(0);
        REP1(i, p)
        {
            Cp.insert(-i);
        }
        REP1(i, q)
        {
            Cq.insert(-i);
        }
        // DUMP(ans);
        for (auto [d, k] : P)
        {
            // DUMP(Cp.sum(k + 1));
            // DUMPA(Cp);
            ll z = *Cp.lower_bound(-k);
            if (z != 0)
            {
                Cp.erase(z);
                ans += d;
            }
            else
            {
                Cp.erase(Cp.begin());
            }
        }
        // DUMP(ans);
        for (auto [d, k] : Q)
        {
            // DUMP(Cp.sum(k + 1));
            ll z = *Cq.lower_bound(-k);
            if (z != 0)
            {
                Cq.erase(z);
                ans += d;
            }
            else
            {
                Cq.erase(Cq.begin());
            }
        }
        // DUMP(ans);
        // for (auto [d, k] : Q)
        // {
        //     if (Cq.sum(k + 1) < k)
        //     {
        //         Cq.add(k, 1);
        //         ans += d;
        //     }
        // }
        OUT(ans);
    }
}

Measured memory_bytes: 20280