/*Bismillahir Rahmanir Rahim*///{
#include <bits/stdc++.h>
#include <ext/numeric>
using namespace std; using __gnu_cxx::power;
using ll = long long; using ull = unsigned long long; using ld = long double;
const ll llinf = (1ll<<61)-1; const double eps = 1e-6, ldeps = 1e-9;
struct Dbg { static constexpr auto &os = cout;   // replace by cerr in interactive.
template<class C> static auto o(C *x)->decltype(os << *x, 0);
template<class C> static char o(...);
template<class C> typename enable_if<sizeof o<C>(0)!=1,Dbg&>::type operator<<(const C &x) {os<<x; return *this;}
template<class C> Dbg &dump(C b, C e) {
    for (struct{C i;int j;} i={(*this<<"\n[",b),0}; i.i!=e and i.j<26; i.i++, i.j++) *this<<", "+2*(i.i==b)<<*i.i;
    return *this << ']';
}
template<class C> typename enable_if<sizeof o<C>(0)==1, Dbg&>::type operator<<(const C &x) {
    return dump(begin(x), end(x));
}
template<class C, size_t X> typename enable_if<!is_same<C, const char>::value, Dbg&>::type operator<<(C (&x)[X]) {
    return dump(begin(x), end(x));
}
template<class B, class C> Dbg &operator<<(const pair<B, C> &x) {return *this<<'{'<<x.first<<", "<<x.second<<'}';}
Dbg &operator<<(ostream&(*x)(std::ostream&)) { os << x; return *this; }
} dbg;
void err(istringstream *iss) { delete iss; }
template<class C, class... Args> void err(istringstream *iss, const C &val, const Args &... args) {
    string name; *iss >> name; if (name.back()==',') name.pop_back();
    dbg << name << " = " << val << "; ", err(iss, args...);
}
#define bug(args...) dbg << __LINE__ << ": ", err(new istringstream(#args), args), dbg << endl
#define cbug(a, args...) if (a) bug(args);
#define ASSERT(a, o, b, args...) if (!((a)o(b))) bug(a, b, ##args), assert((a)o(b));
#define sl(a) int(strlen(a))
#define sz(a) int(a.size())
int T, Q, cn;//}
const int inf = 1000000007, mxn = 200005;

int n, K[mxn];
pair<pair<int, int>, int> a[mxn];

signed main() { cin.tie(0)->sync_with_stdio(0); cin.exceptions(cin.failbit); cout.precision(11), cout.setf(ios::fixed);
    auto kase = [&]()->void {
        sort(a+1, a+1+n, [](const pair<pair<int, int>, int> &l, const pair<pair<int, int>, int> &r) -> bool {
            return l.first.first-l.first.second > r.first.first-r.first.second;
        });

        ll ans = 0;
        for (int i = 1; i <= n; i++) {
            ans += a[i].first.second;
        }

        set<int, greater<int>> s1;
        for (int i = 1; i <= n; i++) {
            s1.insert(i);
        }
        for (int i = 1; i <= n; i++) {
            if (a[i].first.first <= a[i].first.second) break;
            auto it = s1.lower_bound(a[i].second);
            if (it==s1.end()) {
                continue;
            }
            s1.erase(it++);
            ans += a[i].first.first-a[i].first.second;
        }

        set<int> s2;
        for (int i = 1; i <= n; i++) {
            s2.insert(i);
        }
        for (int i = n; i >= 1; i--) {
            if (a[i].first.first >= a[i].first.second) break;
            auto it = s2.upper_bound(a[i].second);
            if (it==s2.end()) {
                ans += a[i].first.first-a[i].first.second;
                continue;
            }
            s2.erase(it++);
        }
        cout << ans << '\n';
    };
    cin >> T;
    while (cn++!=T) {
        cin >> n;
        for (int i = 1; i <= n; i++) {
            cin >> a[i].second >> a[i].first.first >> a[i].first.second;
        }
        // cout << "Case " << cn << ": ";
        kase();
        // resetAll();
    }
}

Measured memory_bytes: 20816