#include <iostream>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <cctype>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <stdlib.h>
#include <tuple>
#include <iomanip>
#include <iterator>
#include <stdio.h>
#include <fstream>
#include <time.h>
#include <bit>
#include <bitset>
#include <cstdint>
using namespace std;
const double PI = 3.14159265358979323846;
const long long int MOD = 1000000000 + 7;

struct UnionFind {
    vector<int> parent;

    UnionFind(int N) : parent(N) {
        for (int i = 0; i < N; i++) {
            parent[i] = -1;
        }
    }

    int root(int i) {
        if (parent[i] < 0) {
            return i;
        }
        return (parent[i] = root(parent[i]));
    }

    bool unite(int from, int to) {
        int rx = root(from);
        int ry = root(to);
        if (rx != ry) {
            parent[ry] += parent[rx];
            parent[rx] = ry;

            return true;
        }
        else {
            return false;
        }
    }

    bool same(int x, int y) {
        return root(x) == root(y);
    }

    int treeSize(int x) {


        return -parent[root(x)];
    }
};

long long int modpow(long long int base, long long int pow, long long int mod) {
    if (pow == 1) {
        return base;
    }
    else if (pow == 0) {
        return 1;
    }

    if (pow % 2 == 0) {
        auto temp = modpow(base, pow / 2, mod);
        return (temp * temp) % mod;
    }
    else {
        return (base * modpow(base, pow - 1, mod)) % mod;
    }
}

long long int moddiv(long long int X, long long int Y, long long int mod) {
    auto fermatDiv = modpow(Y, mod - 2, mod);

    return (X * fermatDiv) % mod;
}

long long modCombination(long long left, long long right, long long int mod) {
    long long answer = 1;
    if (left > right) {
        for (long long i = 0; i < right; i++) {
            answer = (answer * (left - i)) % mod;
            answer = moddiv(answer, (i + 1), mod);
        }
    }
    return answer;
}

bool IsPrime(long long N) {
    if (N == 1) {
        return false;
    }
    for (long long i = 2; i * i <= N; i++) {
        if (N % i == 0) {
            return false;
        }
    }


    return true;
}


vector<pair<long long, long long> > prime_factorize(long long N) {
    vector<pair<long long, long long> > res;
    for (long long a = 2; a * a <= N; ++a) {
        if (N % a != 0) continue;
        long long ex = 0; // 指数

        // 割れる限り割り続ける
        while (N % a == 0) {
            ++ex;
            N /= a;
            
        }

        // その結果を push
        res.push_back({ a, ex });
    }

    // 最後に残った数について
    if (N != 1) res.push_back({ N, 1 });
    return res;
}

map<long long, set<long long>> cache;
set<long long> enum_divisors(long long N) {
    set<long long> res;
    for (long long i = 1; i * i <= N; ++i) {
        if (N % i == 0) {
            res.insert(i);

            if (cache.count(N / i) > 0) {
                auto copy = cache[N / i];
                auto copy2 = cache[N / i];
                for (auto v : res) {
                    if (v != 1) {
                        //cout << "v*" << v << endl;
                        for (auto itr = copy2.begin(); itr != copy2.end(); itr++) {
                            copy.insert(*itr * v);
                        }
                        break;
                    }
                }
                cache[N] = copy;
                return copy;
            }

            // 重複しないならば i の相方である N/i も push
            if (N / i != i) res.insert(N / i);

            
        }
    }

    cache[N] = res;
    return res;
}

long long euclid(long long a, long long b) {
    if (a > b) {
        long long temp = b;
        b = a;
        a = temp;
    }
    if (b % a == 0) {
        return a;
    }
    else {
        return euclid(a, b - a);
    }
}

long long gcd(long long a, long long b) {
    if (b > a) {
        long long temp = b;
        b = a;
        a = temp;
    }
    //cout << "a:" << a << "b:" << b << endl;
    long long c = a % b;
    if (c == 0) {
        return b;
    }
    else {
        return gcd(b, c);
    }
}


struct Camel {
public: int K;
public: int L, R;
public: int minus;
public: 
    Camel(int _K, int _L, int _R) {
        K = _K;
        L = _L;
        R = _R;
        minus = max(L, R) - min(L, R);
        if (L > R) {
            isForward = true;
        }
        else {
            isForward = false;
        }
    }
public :bool isForward;
       bool operator<(const Camel& right) const {
           return minus < right.minus;
       }
};

int main() {
    int T;
    cin >> T;
    for (int l = 0; l < T; l++) {
        int N;
        cin >> N;

        vector<Camel> forwards, backwards;
        long long idealTotal = 0;
        for (int i = 0; i < N; i++) {
            int K, L, R;
            cin >> K >> L >> R;
            if (L > R) {
                forwards.emplace_back(K, L, R);
            }
            else if (R > L) {
                backwards.emplace_back(K, L, R);
            }
            idealTotal += max(L, R);
        }

        sort(forwards.begin(), forwards.end(), [](auto const& l, auto const& r) {
            return l.K > r.K;
            });

        {
            priority_queue<Camel> q;
            int currentIndex = 0;
            int forwardSize = forwards.size();
            int currentPosition = forwardSize;
            while (currentPosition != 0) {
                while (currentIndex < forwardSize && forwards[currentIndex].K >= currentPosition) {
                    q.push(forwards[currentIndex]);
                    
                    currentIndex++;
                }

                if (!q.empty()) {
                    q.pop();
                }

                currentPosition--;
            }
            while (!q.empty()) {
                auto c = q.top();
                idealTotal -= c.minus;
                q.pop();
            }
        }


        sort(backwards.begin(), backwards.end(), [](auto const& l, auto const& r) {
            return l.K < r.K;
            });
        {
            priority_queue<Camel> q;
            int currentIndex = 0;
            int backSize = backwards.size();
            int currentPosition = N - backSize + 1;

            while (currentPosition != N+1) {
                while (currentIndex < backSize && backwards[currentIndex].K < currentPosition) {
                    q.push(backwards[currentIndex]);
                    currentIndex++;
                }
                if (!q.empty()) {
                    q.pop();
                }
                currentPosition++;
            }

            for (; currentIndex < backSize; currentIndex++) {
                q.push(backwards[currentIndex]);
            }

            while (!q.empty()) {
                auto c = q.top();
                idealTotal -= c.minus;
                q.pop();
            }
        }

        cout << idealTotal << endl;
    }
    return 0;
}

Measured memory_bytes: 10812