import java.io.BufferedReader
import java.io.InputStream
import java.io.InputStreamReader
import java.util.*
import kotlin.math.abs
import kotlin.math.max
import kotlin.math.min

val MOD = 1_000_000_007L

data class Entry(val k: Int, val v: Int)
private inline fun remove(map: TreeMap<Int, Int>, k: Int) {
  map.merge(k, -1, Int::plus)
  if (map[k]!! == 0) map.remove(k)
}

class Solver(stream: InputStream, private val out: java.io.PrintWriter) {
  fun solve() {
    for (i in 0 until ni()) {
      out.println(solve2())
    }
  }

  fun solve2(): Long {
    var ans = 0L
    val N = ni()
    val LR = mutableListOf<Entry>()
    val RL = mutableListOf<Entry>()
    for (i in 0 until N) {
      val k = ni() - 1
      val l = ni()
      val r = ni()

      // LR
      if (l > r) {
        ans += r
        LR.add(Entry(k, l - r))
      // RL
      } else if (r > l) {
        ans += l
        RL.add(Entry(N - 1 - k - 1, r - l))
      } else {
        ans += l
      }
    }

    val ansLR = solve3(LR.size, LR)
    val ansRL = solve3(RL.size, RL)
    debug{"$ans $ansLR $ansRL"}

    return ans + ansLR + ansRL
  }

  fun solve3(n: Int, E: List<Entry>): Long {
    val event = Array(n){ mutableListOf<Int>()}
    for (e in E) {
      if (e.k < 0) continue
      event[min(n - 1, e.k)].add(e.v)
    }

    var ans = 0L
    val set = TreeMap<Int, Int>()
    for (i in n - 1 downTo 0) {
      for (v in event[i]) {
        set.merge(v, 1, Int::plus)
      }
      if (!set.isEmpty()) {
        val v = set.lastKey()!!
        ans += v
        remove(set, v)
      }
    }
    return ans
  }













































  private val isDebug = try {
    // なんか本番でエラーでる
    System.getenv("MY_DEBUG") != null
  } catch (t: Throwable) {
    false
  }

  private var tokenizer: StringTokenizer? = null
  private val reader = BufferedReader(InputStreamReader(stream), 32768)
  private fun next(): String {
    while (tokenizer == null || !tokenizer!!.hasMoreTokens()) {
      tokenizer = StringTokenizer(reader.readLine())
    }
    return tokenizer!!.nextToken()
  }

  private fun ni() = next().toInt()
  private fun nl() = next().toLong()
  private fun ns() = next()
  private fun na(n: Int, offset: Int = 0): IntArray {
    return map(n) { ni() + offset }
  }
  private fun nal(n: Int, offset: Int = 0): LongArray {
    val res = LongArray(n)
    for (i in 0 until n) {
      res[i] = nl() + offset
    }
    return res
  }

  private fun na2(n: Int, offset: Int = 0): Array<IntArray> {
    val a  = Array(2){IntArray(n)}
    for (i in 0 until n) {
      for (e in a) {
        e[i] = ni() + offset
      }
    }
    return a
  }

  private inline fun map(n: Int, f: (Int) -> Int): IntArray {
    val res = IntArray(n)
    for (i in 0 until n) {
      res[i] = f(i)
    }
    return res
  }

  private inline fun debug(msg: () -> String) {
    if (isDebug) System.err.println(msg())
  }

  private fun debug(a: LongArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: IntArray) {
    debug { a.joinToString(" ") }
  }

  private fun debug(a: BooleanArray) {
    debug { a.map { if (it) 1 else 0 }.joinToString("") }
  }

  private fun debugDim(A: Array<LongArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }
  private fun debugDim(A: Array<IntArray>) {
    if (isDebug) {
      for (a in A) {
        debug(a)
      }
    }
  }

  /**
   * 勝手にimport消されるのを防ぎたい
   */
  private fun hoge() {
    min(1, 2)
    max(1, 2)
    abs(-10)
  }
}

fun main() {
  val out = java.io.PrintWriter(System.out)
  Solver(System.`in`, out).solve()
  out.flush()
}

Measured memory_bytes: 78224