#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_set>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif
#define GET_MACRO(_1, _2, _3, NAME, ...) NAME
#define _rep(i, n) _rep2(i, 0, n)
#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using i64 = long long;
template<class T, class U>
bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }
template<class T, class U>
bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }

template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}
template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}
template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}
template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}
template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}

int main()
{
    int n, m;
    cin >> n >> m;
    vector<vector<pair<int, int>>> edge(n);
    rep(i, m)
    {
        int s, t, d;
        cin >> s >> t >> d;
        s--, t--;
        edge[s].emplace_back(t, d);
        edge[t].emplace_back(s, d);
    }
    int ans = 1e9;
    int ok = 0, ng = 1e9 + 1;
    while(ng - ok > 1)
    {
        int mid = (ok + ng) / 2;
        queue<int> que;
        que.push(0);
        vector<int> visited(n, -1);
        visited[0] = 0;
        while(!que.empty())
        {
            auto now = que.front();
            que.pop();
            for (auto [e, d]: edge[now])
            {
                if (d < mid) continue;
                if (visited[e] != -1) continue;
                visited[e] = visited[now] + 1;
                que.push(e);
            }
        }
        if (visited[n - 1] == -1) ng = mid;
        else
        {
            ok = mid;
            ans = visited[n - 1];
        }
    }
    cout << ok << " " << ans << endl;
}