import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}
	// ======================================================================
	TreeSet<Integer> set = new TreeSet();
	PriorityQueue<PPP> PQL = new PriorityQueue<PPP>(comparing(PPP::getKey, reverseOrder())); 
	PriorityQueue<PPP> PQR = new PriorityQueue<PPP>(comparing(PPP::getKey, reverseOrder())); 
	public void solve() {
		int T = ni();
		int N;
		int k, l, r, cnt;
		long ans;
		PPP pp;
		Integer wk;
		for (int i = 0; i < T; i++) {
			N = ni();
			set.clear();
			for (int j = 0; j < N; j++) 	set.add(j);
			PQL.clear();
			PQR.clear();
			for (int j = 0; j < N; j++) {
				k = ni();
				l = ni();
				r = ni();
				if(l >= r)	PQL.add(new PPP(l, r, k, j));
				else		PQR.add(new PPP(r, l, k-1, j));
			}
			cnt = PQL.size();
			ans = 0;
			while(!PQL.isEmpty()) {
				pp = PQL.poll();
				wk = set.lower(pp.val2);
				if(wk != null) {
					ans += pp.key;
					set.remove(wk);
				} else {
					ans += pp.val;
//					wk = set.higher(pp.val2-1);
//					set.remove(wk);
				}
			}
			set.clear();
			for (int j = cnt; j < N; j++) 	set.add(j);
			while(!PQR.isEmpty()) {
				pp = PQR.poll();
				wk = set.higher(pp.val2);
				if(wk != null) {
					ans += pp.key;
					set.remove(wk);
				} else {
					ans += pp.val;
//					wk = set.lower(pp.val2+1);
//					set.remove(wk);
				}
			}
			out.println(ans);
		}
	}
	// Set に入れるなら　PPKEY　を使う！
	class PPP {
		public int key, val, val2, val3;
		public PPP(int key, int val, int val2, int val3) {
			this.key = key;
			this.val = val;
			this.val2 = val2;
			this.val3 = val3;
		}
		public int getKey() {			return key;			}
		public void setKey(int key) {	this.key = key;		}
		public int getVal() {			return val;			}
		public void setVal(int val) {	this.val = val;		}
		public int getVal2() {			return val2;		}
		public void setVal2(int val2) {	this.val2 = val2;	}
	}

	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);
	
	// Scanner
	private FastScanner scan = new FastScanner();
	int ni(){ return scan.nextInt();}
	int[] ni(int n){int[] a = new int[n]; for(int i = 0; i < n; i++){a[i] = ni();} return a;}
	int[][] ni(int y, int x){int[][] a = new int[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ni();}} return a;}
	long nl(){return scan.nextLong();}
	long[] nl(int n){long[] a = new long[n]; for(int i = 0; i < n; i++){a[i] = nl();} return a;}
	long[][] nl(int y, int x){long[][] a = new long[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = nl();}} return a;}
	String ns(){return scan.next();}
	String[] ns(int n){String[] a = new String[n]; for(int i = 0; i < n; i++){a[i] = ns();} return a;}
	String[][] ns(int y, int x){String[][] a = new String[y][x];
	for(int i = 0; i < y; i++){for(int j = 0; j < x; j++){a[i][j] = ns();}} return a;}
}
class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
		return (int) nl;
	}
	public double nextDouble() { return Double.parseDouble(next());}
}
