1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int maxn=100005;
 4 const int maxm=200010;
 5 int n,m;
 6 struct edge
 7 {
 8     int u,v,w,nxt;
 9 }e[maxm<<1],ee[maxm];
10 int head[maxn],js;
11 void addage(int u,int v,int w)
12 {
13     e[++js].u=u;e[js].v=v;e[js].w=w;
14     e[js].nxt=head[u];head[u]=js;
15 }
16 int fa[maxn];
17 long long ans;
18 int find(int x)
19 {
20     if(fa[x]==x)return x;
21     return fa[x]=find(fa[x]);
22 }
23 bool un(int u,int v)
24 {
25     u=find(u),v=find(v);
26     if(u==v)return 0;
27     fa[v]=u;
28     return 1;
29 }
30 long long dl1[maxn],dl2[maxn],ul[maxn];
31 void dfs(int u,int fa)
32 {
33     for(int i=head[u];i;i=e[i].nxt)
34     {
35         int v=e[i].v;
36         if(v!=fa)
37         {
38             dfs(v,u);
39             if(dl1[v]+e[i].w>dl1[u])dl2[u]=dl1[u],dl1[u]=dl1[v]+e[i].w;
40             else if(dl1[v]+e[i].w>dl2[u])dl2[u]=dl1[v]+e[i].w;
41         }
42     }
43 }
44 void dfs2(int  u,int fa)
45 {
46     for(int i=head[u];i;i=e[i].nxt)
47     {
48         int v=e[i].v;
49         if(v!=fa)
50         {
51             if(dl1[v]+e[i].w==dl1[u])ul[v]=dl2[u];
52             else ul[v]=dl1[u];
53             if(ul[u]>ul[v])ul[v]=ul[u];
54             ul[v]+=e[i].w;
55             dfs2(v,u);
56         }
57     }
58 }
59 bool mycp(edge a,edge b)
60 {
61     return a.w<b.w;
62 }
63 int main()
64 {
65     scanf("%d%d",&n,&m);
66     for(int i=1;i<=n;++i)fa[i]=i;
67     for(int u,v,w,tp=0,i=0;i<m;++i)
68     {
69         scanf("%d%d%d",&u,&v,&w);
70         ee[i].u=u;ee[i].v=v;ee[i].w=w;
71
72     }
73     sort(ee,ee+m,mycp);
74     for(int i=0;i<m;++i)
75     {
76         int u=ee[i].u,v=ee[i].v,w=ee[i].w;
77         if(un(u,v))
78         {
79             ans+=w;
80             addage(u,v,w);
81             addage(v,u,w);
82         }
83     }
84     dfs(1,0);
85     dfs2(1,0);
86     long long ans2=0x7ffffffffffffff;
87     for(int i=1;i<=n;++i)
88     {
89         int tp=max(ul[i],dl1[i]);
90         ans2=ans2<tp?ans2:tp;
91     }
92     printf("%lld\n%lld",ans,ans2);
93     return 0;
94 }