#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
const long long mod = 1e9 + 7;
int sum(int a, int b) { return (a + b) % mod; }
int sub(int a, int b) { return (a + mod - b) % mod; }
int mul(int a, int b) { return (1ll * a * b) % mod; }
int power(int a, int b) {
  int res = 1;
  while (b) {
    if (b & 1) res = mul(res, a);
    b >>= 1;
    a = mul(a, a);
  }
  return res;
}
const int maxn = 2e5 + 10;
vector<pair<int, int>> graph[maxn];
int N, sz[maxn], dist[maxn];
void dfs(int u, int p, int d) {
  sz[u] = 1;
  dist[u] = d;
  for (auto &act : graph[u]) {
    int v = act.first;
    if (v == p) continue;
    dfs(v, u, d + 1);
    sz[u] += sz[v];
  }
}
void solve() {
  cin >> N;
  for (int i = 0; i < 2 * N; i++) {
    graph[i].clear();
    sz[i] = 0;
    dist[i] = 0;
  }
  vector<pair<int, pair<int, int>>> edges;
  for (int i = 0; i < 2 * N - 1; i++) {
    int u, v, c;
    cin >> u >> v >> c;
    u--;
    v--;
    graph[u].push_back({v, c});
    graph[v].push_back({u, c});
    edges.push_back({c, {u, v}});
  }
  dfs(0, 0, 0);
  long long maxi = 0;
  long long mini = 0;
  for (auto &act : edges) {
    int u = act.second.first;
    int v = act.second.second;
    int c = act.first;
    if (dist[u] > dist[v]) swap(u, v);
    int cv = sz[v];
    int cu = 2 * N - cv;
    maxi += 1LL * min(cu, cv) * c;
    mini += 1LL * (cu % 2) * c;
  }
  cout << mini << ' ' << maxi << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int T;
  cin >> T;
  while (T--) {
    solve();
  }
  return 0;
}
