#define CPP17
#include <limits>
#include <initializer_list>
#include <utility>
#include <bitset>
#include <tuple>
#include <type_traits>
#include <functional>
#include <string>
#include <array>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <iterator>
#include <algorithm>
#include <complex>
#include <random>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <regex>
#include <cassert>
#include <cstddef>
#ifdef CPP17
#include <variant>
#endif

#define endl codeforces

#define ALL(v) std::begin(v), std::end(v)
#define ALLR(v) std::rbegin(v), std::rend(v)

using ll = std::int64_t;
using ull = std::uint64_t;
using pii = std::pair<int, int>;
using tii = std::tuple<int, int, int>;
using pll = std::pair<ll, ll>;
using tll = std::tuple<ll, ll, ll>;
using size_type = ssize_t;
template <typename T> using vec = std::vector<T>;
template <typename T> using vvec = vec<vec<T>>;

template <typename T> const T& var_min(const T &t) { return t; }
template <typename T> const T& var_max(const T &t) { return t; }
template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }
template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }
template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }
template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }

template <typename T, std::size_t Head, std::size_t... Tail> 
struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };

template <typename T, std::size_t Head> 
struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };

template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;

#ifdef CPP17
template <typename T, typename F, typename... Args> 
void fill_seq(T &t, F f, Args... args) { 
    if constexpr (std::is_invocable<F, Args...>::value) { 
        t = f(args...); 
    } else { 
        for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i); 
    } 
}
#endif

template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }

template <typename T, typename... Tail> 
auto make_v(size_type hs, Tail&&... ts) { 
    auto v = std::move(make_v<T>(std::forward<Tail>(ts)...)); 
    return vec<decltype(v)>(hs, v); 
}

namespace init__ { 
struct InitIO { 
    InitIO() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << std::fixed << std::setprecision(30); } 
} init_io; 
}
#define CPP17


const ll inf = 5e15;

ll solve_aux(std::priority_queue<pll> &pq) {
    std::set<ll> pos;
    for (ll i = 0; i < pq.size(); i++) pos.insert(i);
    pos.insert(inf);
    pos.insert(-1);
    ll ans = 0;
    while (pq.size()) {
        auto [ score, idx ] = pq.top();
        pq.pop();
        auto ite = std::prev(pos.upper_bound(idx));
        if (*ite == -1) continue;
        ans += score;
        pos.erase(ite);
    }
    return ans;
}

ll solve() {
    ll n;
    std::cin >> n;
    vec<tll> v(n);
    for (auto &[ k, l, r ] : v) {
        std::cin >> k >> l >> r;
        k--;
    }

    ll ans = 0;
    std::priority_queue<pll> pq1, pq2;
    for (ll i = 0; i < n; i++) {
        auto [ k, l, r ] = v[i];
        if (k == n - 1 || l == r) {
            ans += l;
            continue;
        }
        if (l < r) {
            ans += l;
            // k == n-2 => 0
            pq2.emplace(r - l, n - 2 - k);
        } else {
            ans += r;
            pq1.emplace(l - r, k);
        }
    }

    ans += solve_aux(pq1);
    ans += solve_aux(pq2);
    return ans;
}

int main() {
    ll t;
    std::cin >> t;
    while (t--) std::cout << solve() << "\n";
    return 0;
}


Measured memory_bytes: 15764