#define _USE_MATH_DEFINES
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); ++i)
#define reps(i, n) for (int i = 1; i <= (n); ++i)
#define repd(i, n) for (int i = (n)-1; i >= 0; --i)
#define repds(i, n) for (int i = (n); i > 0; --i)
#define loop(i, x, n) for (int i = (x); i < (n); ++i)
#define loops(i, x, n) for (int i = (x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (x); i > (n); --i)
#define loopds(i, x, n) for (int i = (x); i >= (n); --i)
#define itrep(i, a) for (auto i = begin(a); i != end(a); ++i)
#define itrepd(i, a) for (auto i = rbegin(a); i != rend(a); ++i)
#define each(i, x) for (auto &&i : x)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(a) ((int)a.size())
#define pow2(n) (n * n)
#define int ll
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
template <class T>
using p_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr ll inf = static_cast<ll>(1e18);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e18;
constexpr double eps = 1e-9;
ll mod = static_cast<ll>(1e9 + 7);
template <class T, class... Args>
constexpr void mins(T &a, Args... args) { a = min<T>({a, args...}); }
template <class T, class... Args>
constexpr void maxs(T &a, Args... args) { a = max<T>({a, args...}); }
template <class F>
class FixPoint : private F {
public:
    explicit constexpr FixPoint(F &&f) : F(std::forward<F>(f)) {}
    template <class... Args>
    constexpr decltype(auto) operator()(Args &&... args) const { return F::operator()(*this, std::forward<Args>(args)...); }
};
template <class F>
constexpr decltype(auto) funcs(F &&f) { return FixPoint<F>{std::forward<F>(f)}; }
template <class T>
std::vector<T> vecs(int n, T &&val) { return std::vector<T>(std::forward<int>(n), std::forward<T>(val)); }
template <class... Args>
decltype(auto) vecs(int n, Args &&... args) { return std::vector<decltype(vecs(std::forward<Args>(args)...))>(std::forward<int>(n), vecs(std::forward<Args>(args)...)); }
template <class V, class T>
void fill(V &x, const T &val) { x = val; }
template <class V, class T>
void fill(vector<V> &vec, const T &val) {
    for (auto &&v : vec)
        fill(v, val);
}

void solve() {
    int t;
    cin >> t;
    rep(_, t) {
        int n;
        cin >> n;
        vector<int> k(n), l(n), r(n);
        rep(i, n) {
            cin >> k[i] >> l[i] >> r[i];
            --k[i];
        }

        vector<pair<int, pair<int, int>>> p1, p2;
        rep(i, n) {
            if (l[i] - r[i] > 0)
                p1.emplace_back(-(l[i] - r[i]), make_pair(k[i], i));
            else
                p2.emplace_back(l[i] - r[i], make_pair(-k[i], i));
        }

        sort(all(p1));
        sort(all(p2));
        each(x, p1)
            x.first *= -1;
        each(x, p2) x.second.first *= -1;

        auto g1 = [&](auto &s, int &ans) {
            each(x, p1) {
                int idx = x.second.second;
                auto ptr = s.upper_bound(k[idx]);
                if (ptr == s.begin()) {
                    continue;
                }
                --ptr;
                s.erase(ptr);
                ans += x.first;
            }
        };

        auto g2 = [&](auto &s, int &ans) {
            each(x, p2) {
                int idx = x.second.second;
                auto ptr = s.upper_bound(k[idx]);
                if (ptr == s.end()) {
                    ans += x.first;
                    continue;
                }
                s.erase(ptr);
            }
        };

        auto f = [&](bool way) {
            int ans = accumulate(all(r), 0LL);
            set<int> s;
            rep(i, n) s.emplace(i);
            if (way) {
                g1(s, ans);
                g2(s, ans);
            } else {
                g2(s, ans);
                g1(s, ans);
            }
            return ans;
        };
        cout << max(f(true), f(false)) << '\n';
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    solve();
    cout.flush();
    return 0;
}