#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define INF 1000000001LL
#define LNF 1000000000000000001LL
#define MOD 1000000007LL
#define MAX 502
#define long long long
#define all(x) x.begin(),x.end()
using namespace std;


vector<pair<int,pair<int,int>>> edge;
vector<int> graph[100001];
vector<int> parent(100001);
int find(int x)
{
    if(parent[x] == x)
        return x;
    return parent[x] = find(parent[x]);
}

bool merge(int x, int y)
{
    x = find(x);
    y = find(y);

    if(x == y)
        return 1;
    if(x < y)
        parent[y] = x;
    else
        parent[x] = y;
    return 0;
}
int check(int n,int x)
{
    for(int i = 0; i<=n; i++)
        parent[i] = i;
    for(int i = 0; i<edge.size(); i++)
    {
        int d = edge[i].first;
        int u = edge[i].second.first;
        int v = edge[i].second.second;
        if(d >= x)
            merge(u,v);
    }
    return merge(1,n);
}
int main()
{
	ios_base::sync_with_stdio(0); 
    cin.tie(0);

    int n,m;
    cin >> n >> m;

    for(int i = 0; i<m; i++)
    {
        int a,b,c;
        cin >> a >> b >> c;

        edge.push_back({c,{a,b}});
    }

    int start = 0;
    int end = INF;
    int res = 0;
    while(start<=end)
    {
        int mid = (start+end)/2;

        if(check(n,mid))
        {
            start = mid+1;
            res = mid;
        }
        else
            end = mid-1;
    }

    for(int i = 0; i<m; i++)
    {
        if(edge[i].first >= res)
        {
            int a = edge[i].second.first;
            int b = edge[i].second.second;
            graph[a].push_back(b);
            graph[b].push_back(a);
        }
    }

    vector<int> vis(n+1,-1);
    queue<int> q;
    q.push(1);
    vis[1] = 0;
    int mx = 0;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        mx = max(mx,vis[x]);
        for(int y : graph[x])
        {
            if(vis[y] != -1)
                continue;
            vis[y] = vis[x]+1;
            q.push(y);
        }
    }

    cout << res << " " << mx << endl;
    return 0;
}