// ${url}
//
#![allow(unused_imports)]
use std::io::*;
use std::io::Write;
use std::fmt::*;
use std::str::*;
use std::cmp::*;
use std::collections::*;

// Input macros.
// Original by tanakh: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
#[allow(unused_macros)]
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};

    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };

    ($iter:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };

    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };

    ($iter:expr, [ next / $t:tt ]) => {
        {
            let len = read_value!($iter, usize);
            (0..len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        }
    };

    ($iter:expr, switch) => {
        {
            let ty = read_value!($iter, i32);
            if ty == 1 {
                vec![ty, read_value!($iter, i32), read_value!($iter, i32)]
            } else if ty == 2 {
                vec![ty, read_value!($iter, i32)]
            } else {
                vec![ty, read_value!($iter, i32)]
            }
        }
    };

    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };

    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };

    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_macros)]
macro_rules! read_line {
    ($t:tt) => {
        {
            let mut s = String::new();
            std::io::stdin().read_line(&mut s).unwrap();
            s.trim_right().parse::<$t>().unwrap()
        }
    }
}

#[allow(unused_macros)]
macro_rules! dvec {
    ($t:expr ; $len:expr) => {
        vec![$t; $len]
    };

    ($t:expr ; $len:expr, $($rest:expr),*) => {
        vec![dvec!($t; $($rest),*); $len]
    };
}

#[allow(unused_macros)]
macro_rules! ifv {
    ($t:expr, $a:expr, $b: expr) => {
        if $t { $a } else { $b }
    }
}

#[allow(unused_macros)]
macro_rules! fill {
    ($t:expr, $v:expr) => {
        for i in 0..$t.len() {
            $t[i] = $v;
        }
    };
}

#[allow(unused_macros)]
macro_rules! join {
    ($t:expr, $glue:expr) => {
        $t.into_iter().map(|w| w.to_string()).collect::<Vec<_>>().join($glue)
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
    }
}

// ===

fn solve(a: Vec<(usize, i64, i64)>) -> i64 {
    let n = a.len();
    let mut vacant = BTreeSet::new();
    let mut occupied = BTreeSet::new();
    for i in 1..n+1 {
        vacant.insert(i);
    }
    let mut camels = vec![];
    for i in 0..n {
        camels.push((a[i].1-a[i].2, a[i].0));
    }
    camels.sort();
    camels.reverse();

    let mut scores = 0;
    for i in 0..n {
        let sc = camels[i].0;
        let pt = camels[i].1;
        if sc <= 0 {
            break;
        }
        if let Some(&idx) = vacant.range(..=pt).rev().next() {
            scores += sc;
            vacant.remove(&idx);
            occupied.insert(idx);
        }
    }

    for i in 1..n {
        if vacant.contains(&i) {
            if let Some(&idx) = occupied.range(i+1..=n).rev().next() {
                vacant.insert(idx);
                occupied.remove(&idx);
                vacant.remove(&i);
                occupied.insert(i);
            }
        }
    }

    for i in (0..n).rev() {
        let sc = camels[i].0;
        let pt = camels[i].1;
        if sc >= 0 {
            break;
        }
        if pt >= n {
            scores += sc;
        } else if let Some(&idx) = vacant.range(pt+1..=n).next() {
            vacant.remove(&idx);
            occupied.insert(idx);
        } else {
            // if let Some(&idx) = occupied.range(1..=pt).next
            scores += sc;
        }
    }
    for i in 0..n {
        scores += a[i].2;
    }
    scores
}

fn main() {
    input! {
        t: usize,
        testcases: [[next / (usize, i64, i64)]; t]
    };

    for test in testcases {
        println!("{}", solve(test));
    }
}


Measured memory_bytes: 18788