#include <bits/stdc++.h>
#define DBG(x) cerr << #x << " = " << x << endl

using namespace std;
typedef long long ll;

const int N = 2e5 + 5;

int n, head[N], tot, sz[N]; ll mx, mn;
struct Enode {
    int to, nxt, w;
} edge[N * 2];

void addedge(int u, int v, int w) {
    edge[tot].to = v;
    edge[tot].w = w;
    edge[tot].nxt = head[u];
    head[u] = tot++;
} 

void dfs(int u, int f) {
    sz[u] = 1;
    for(int i = head[u]; i != -1; i = edge[i].nxt) {
        int v = edge[i].to, w = edge[i].w;
        if(v == f) continue;
        dfs(v, u);
        if(sz[v] & 1) mn += w;
        mx += (ll)w * min(sz[v], n - sz[v]);
        sz[u] += sz[v];
    }
}

void solve() {
    scanf("%d", &n);
    for(int i = 1; i <= 2 * n; i++) head[i] = -1, sz[i] = 0; tot = mn = mx = 0;
    n = 2 * n;
    for(int i = 1, u, v, w; i < n; i++) {
        scanf("%d%d%d", &u, &v, &w);
        addedge(u, v, w);
        addedge(v, u, w);
    }
    dfs(1, -1);
    printf("%lld %lld\n", mn, mx);
}

int main() {
    int cs; for(scanf("%d", &cs); cs--; solve());   
}