#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll inf = 1e18;
struct node { int v, w; };
struct DSU {
    vector<int> fa;
    DSU(int n) { init(n); } void init(int n) {
        fa.resize(n); iota(fa.begin(), fa.end(), 0);
    }
    int find(int x) {
        if (fa[x] != x) fa[x] = find(fa[x]);
        return fa[x];
    }
    void merge(int u, int v) { fa[find(u)] = find(v); }
    bool same(int u, int v) { return find(u) == find(v); }
};
struct st {
    array<vector<node>, 19> s;
    vector<vector<node>> mp;
    vector<int> dep;
    int n;
    void init(int _n) {
        n = _n;
        for (int i = 0; i < 19; ++i)
            s[i] = vector<node>(n + 1);
        mp = vector<vector<node>>(n + 1);
        dep = vector<int>(n + 1); dep[1] = 1;
    }
    void add(int u, int v, int w) {
        mp[u].push_back({ v,w });
        mp[v].push_back({ u,w });
    }
    void build() {
        dfs(1);
        for (int b = 1; b <= __lg(n); ++b) {
            for (int i = 1; i <= n; ++i) {
                auto [v, w] = s[i][b - 1];
                s[b][i] = s[b - 1][v];
                s[b][i].w = max(s[b][i].w, w);
            }
        }
    }
    int query(int u, int v) {
        if (dep[u] < dep[v]) swap(u, v);
        int res = 0;
        while (dep[u] > dep[v]) {
            auto [x, w] = s[__lg(dep[u] - dep[v])][u];
            u = x, res = max(res, w);
        }
        if (u == v) return res;
        for (int b = __lg(dep[u]); b >= 0; --b) {
            auto [lv, lw] = s[b][u];
            auto [rv, rw] = s[b][v];
            if (lv == rv) continue;
            res = max({ res,lw,rw });
            u = lv, v = rv;
        }
        res = max({ res,s[0][u].w,s[0][v].w });
        return res;
    }
    void dfs(int u) {
        for (auto [v, w] : mp[u]) {
            if (v == s[0][u].v) continue;
            dep[v] = dep[u] + 1;
            s[0][v] = { u,w }; dfs(v);
        }
    }
};
void solve() {
    int n, m; cin >> n >> m;
    // vector<vector<node>> mp(n + 1);
    vector<array<int, 3>> e(m);
    vector<bool> vis(m);
    for (auto& [w, u, v] : e)
        cin >> u >> v >> w;
    sort(e.begin(), e.end());
    DSU d(n + 1); ll sum = 0;
    st s; s.init(n); int q = 0;
    for (int i = 0; i < m; ++i) {
        auto [w, u, v] = e[i];
        if (d.same(u, v)) continue;
        sum += w; d.merge(u, v);
        vis[i] = true; ++q;
        s.add(u, v, w);
    }
    // cerr << "buildede" << endl;
    // 判断不连通
    if (q < n - 1) {
        cout << "-1 -1\n";
        return;
    }
    s.build();
    // cerr << "builded" << endl;
    array<ll, 2> ans{ inf,inf };
    ans[sum & 1] = sum;
    for (int i = 0; i < m; ++i) {
        if (vis[i]) continue;
        auto [w, u, v] = e[i];
        int mx = s.query(u, v);
        ll nres = sum - mx + w;
        if ((nres & 1) == (sum & 1)) continue;
        ans[nres & 1] = min(ans[nres & 1], nres);
    }
    if (ans[0] == inf) ans[0] = -1;
    if (ans[1] == inf) ans[1] = -1;
    cout << ans[0] << ' ' << ans[1] << '\n';
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(0);
    int t; cin >> t;
    while (t--)
        solve();
    return 0;
}