import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.util.stream.LongStream;
import java.util.PriorityQueue;
import java.util.Collection;
import java.util.AbstractQueue;
import java.io.IOException;
import java.util.ArrayList;
import java.io.UncheckedIOException;
import java.util.List;
import java.util.AbstractCollection;
import java.util.stream.Stream;
import java.io.Closeable;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) throws Exception {
        Thread thread = new Thread(null, new TaskAdapter(), "", 1 << 29);
        thread.start();
        thread.join();
    }

    static class TaskAdapter implements Runnable {
        @Override
        public void run() {
            InputStream inputStream = System.in;
            OutputStream outputStream = System.out;
            FastInput in = new FastInput(inputStream);
            FastOutput out = new FastOutput(outputStream);
            ECamelTrain solver = new ECamelTrain();
            int testCount = Integer.parseInt(in.next());
            for (int i = 1; i <= testCount; i++)
                solver.solve(i, in, out);
            out.close();
        }
    }

    static class ECamelTrain {
        public void solve(int testNumber, FastInput in, FastOutput out) {
            int n = in.readInt();
            Camel[] camels = new Camel[n];
            List<Camel> left = new ArrayList<>(n);
            List<Camel> right = new ArrayList<>(n);
            for (int i = 0; i < n; i++) {
                camels[i] = new Camel();
                camels[i].k = in.readInt();
                camels[i].l = in.readInt();
                camels[i].r = in.readInt();

                if (camels[i].l >= camels[i].r) {
                    left.add(camels[i]);
                } else {
                    camels[i].k = n - camels[i].k;
                    int tmp = camels[i].l;
                    camels[i].l = camels[i].r;
                    camels[i].r = tmp;
                    right.add(camels[i]);
                }
                camels[i].punish = camels[i].l - camels[i].r;
            }

            left.sort((a, b) -> Integer.compare(a.k, b.k));
            right.sort((a, b) -> Integer.compare(a.k, b.k));

            long ans = maxProfit(left) + maxProfit(right);

            out.println(ans);
        }

        public long maxProfit(List<Camel> camels) {
            if (camels.isEmpty()) {
                return 0;
            }
            PriorityQueue<Camel> pq = new PriorityQueue<>(camels.size(), (a, b) -> Integer.compare(a.punish, b.punish));
            long sum = camels.stream().mapToLong(x -> x.l).sum();
            for (Camel c : camels) {
                if (pq.size() < c.k) {
                    pq.add(c);
                } else {
                    if (!pq.isEmpty() && pq.peek().punish < c.punish) {
                        sum -= pq.remove().punish;
                        pq.add(c);
                    } else {
                        sum -= c.punish;
                    }
                }
            }
            return sum;
        }

    }

    static class FastInput {
        private final InputStream is;
        private StringBuilder defaultStringBuf = new StringBuilder(1 << 13);
        private byte[] buf = new byte[1 << 13];
        private int bufLen;
        private int bufOffset;
        private int next;

        public FastInput(InputStream is) {
            this.is = is;
        }

        private int read() {
            while (bufLen == bufOffset) {
                bufOffset = 0;
                try {
                    bufLen = is.read(buf);
                } catch (IOException e) {
                    bufLen = -1;
                }
                if (bufLen == -1) {
                    return -1;
                }
            }
            return buf[bufOffset++];
        }

        public void skipBlank() {
            while (next >= 0 && next <= 32) {
                next = read();
            }
        }

        public String next() {
            return readString();
        }

        public int readInt() {
            int sign = 1;

            skipBlank();
            if (next == '+' || next == '-') {
                sign = next == '+' ? 1 : -1;
                next = read();
            }

            int val = 0;
            if (sign == 1) {
                while (next >= '0' && next <= '9') {
                    val = val * 10 + next - '0';
                    next = read();
                }
            } else {
                while (next >= '0' && next <= '9') {
                    val = val * 10 - next + '0';
                    next = read();
                }
            }

            return val;
        }

        public String readString(StringBuilder builder) {
            skipBlank();

            while (next > 32) {
                builder.append((char) next);
                next = read();
            }

            return builder.toString();
        }

        public String readString() {
            defaultStringBuf.setLength(0);
            return readString(defaultStringBuf);
        }

    }

    static class FastOutput implements AutoCloseable, Closeable, Appendable {
        private StringBuilder cache = new StringBuilder(10 << 20);
        private final Writer os;

        public FastOutput append(CharSequence csq) {
            cache.append(csq);
            return this;
        }

        public FastOutput append(CharSequence csq, int start, int end) {
            cache.append(csq, start, end);
            return this;
        }

        public FastOutput(Writer os) {
            this.os = os;
        }

        public FastOutput(OutputStream os) {
            this(new OutputStreamWriter(os));
        }

        public FastOutput append(char c) {
            cache.append(c);
            return this;
        }

        public FastOutput append(long c) {
            cache.append(c);
            return this;
        }

        public FastOutput println(long c) {
            return append(c).println();
        }

        public FastOutput println() {
            cache.append(System.lineSeparator());
            return this;
        }

        public FastOutput flush() {
            try {
                os.append(cache);
                os.flush();
                cache.setLength(0);
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
            return this;
        }

        public void close() {
            flush();
            try {
                os.close();
            } catch (IOException e) {
                throw new UncheckedIOException(e);
            }
        }

        public String toString() {
            return cache.toString();
        }

    }

    static class Camel {
        int k;
        int l;
        int r;
        int punish;

    }
}

