#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define pii pair<int,int>
#define mp make_pair
#define int long long
using namespace std;int fa[200010],vis[200010],deep[200010],n,m,f[19][250010],d[19][250010],ans1,ans2;
vector<pii> g[200010];
struct line
{int from,to,cost;
}l[200010];int cmp(line a,line b)
{return a.cost<b.cost;
}void init()
{for(int i=1;i<=n;i++){fa[i]=i;}
}int find(int x)
{if(fa[x]==x) return x;return fa[x]=find(fa[x]);
}void unity(int t,int x,int y,int c)
{int fx=find(x);int fy=find(y);if(fx==fy) return ;fa[fx]=fy;ans1+=c;vis[t]=1;
    g[x].push_back(mp(y,c));g[y].push_back(mp(x,c));
}void dfs(int now,int ff,int dist,int dep)
{d[0][now]=dist;f[0][now]=ff;deep[now]=dep;for(int i=1;i<=18;i++){f[i][now]=f[i-1][f[i-1][now]];}for(int i=1;i<=18;i++){d[i][now]=max(d[i-1][now],d[i-1][f[i-1][now]]);}for(int i=0;i<g[now].size();i++){if(g[now][i].first==ff) continue;dfs(g[now][i].first,now,g[now][i].second,dep+1);}
}int get(int u,int v)
{int x=u,y=v;if(deep[x]<deep[y]) swap(x,y);int di=0;for(int i=18;i>=0;i--){if(deep[f[i][x]]>=deep[y]){di=max(di,d[i][x]);x=f[i][x];}}if(x==y) return di;for(int i=18;i>=0;i--){if(f[i][x]!=f[i][y]){di=max(max(d[i][x],d[i][y]),di);x=f[i][x];y=f[i][y];}}return max(di,max(d[0][x],d[0][y]));
}signed main()
{scanf("%lld%lld",&n,&m);init();for(int i=1;i<=m;i++){scanf("%lld%lld%lld",&l[i].from,&l[i].to,&l[i].cost);}sort(l+1,l+m+1,cmp);for(int i=1;i<=m;i++){unity(i,l[i].from,l[i].to,l[i].cost);}dfs(1,0,0,1);ans2=1e16;for(int i=1;i<=m;i++){if(!vis[i]){ans2=min(ans2,ans1+l[i].cost-get(l[i].from,l[i].to));}}printf("%lld %lld\n",ans1,ans2);
}