#include <stdio.h>

 #include <string.h>

 #include <algorithm>

 using namespace std;

 const int maxn = ;

 const int inf = 0x3f3f3f3f;

 int mp[maxn][maxn];

 bool vis[maxn];

 bool used[maxn][maxn];

 int d[maxn];

 int path[maxn][maxn];

 int pre[maxn];

 int prim(int n)

 {

     memset(path,,sizeof(path));

     memset(vis,,sizeof(vis));

     memset(used,,sizeof(used));

     vis[] = ;

     d[] = ;

     int ans = ;

     for (int i = ;i <= n;i++)

     {

         pre[i] = ;

         d[i]= mp[][i];

     }

     for (int i = ;i < n - ;i++)

     {

         int x = -,dis = inf;

         for (int j = ;j <= n;j++)

         {

             if (!vis[j] && d[j] < dis)

             {

                 dis = d[j];

                 x = j;

             }

         }

         vis[x] = ;

         used[x][pre[x]] = used[pre[x]][x] = ;

         ans += dis;

         for (int j = ;j <= n;j++)

         {

             if (vis[j] && j != x) path[j][x] = path[x][j] = max(dis,path[j][pre[x]]);

             if (!vis[j] && mp[x][j] < d[j])

             {

                 d[j] = mp[x][j];

                 pre[j] = x;

             }

         }

     }

     return ans;

 }

 int main()

 {

     int t;

     scanf("%d",&t);

     while (t--)

     {

         int n,m;

         scanf("%d%d",&n,&m);

         memset(mp,inf,sizeof(mp));

         for (int i = ;i < m;i++)

         {

             int a,b,c;

             scanf("%d%d%d",&a,&b,&c);

             mp[a][b] = mp[b][a] = min(mp[a][b],c);

         }

         int ans1 = prim(n);

         int ans2 = inf;

         for (int i = ;i <= n;i++)

         {

             for (int j = i + ;j <= n;j++)

             {

                 if (used[i][j]) continue;

                 ans2 = min(ans2,ans1 - path[i][j] + mp[i][j]);

             }

         }

         printf("%d %d\n",ans1,ans2);

     }

     return ;

 }