#include <bits/stdc++.h>
#include<atcoder/all>
using namespace atcoder;
#define rep(i, n) for(ll i = 0; i < n; i++)
#define rep2(i, m, n) for(ll i = m; i <= n; i++)
#define rrep(i, m, n) for(ll i = m; i >= n; i--)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define MAX(x) *max_element(all(x))
#define MIN(x) *min_element(all(x))
#define SZ(a) ((ll)(a).size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
const int dx[4] = { -1, 1, 0, 0 };
const int dy[4] = { 0, 0, 1, -1 };
const int inf = 1e9 + 1;
const ll INF = 1e18 + 1;
const double pi = acos(-1);

using Graph = vector<vector<int>>;
Graph G;

typedef atcoder::modint1000000007 mint;
//typedef atcoder::modint998244353 mint;
//typedef modint mint;
struct Edge {
    int to;
    ll cost;
    Edge(int t, ll c) : to(t), cost(c) {

    }

};
struct Node {
    int node;
    ll cost;
    Node(int n, ll c) : node(n), cost(c) {

    }
    bool operator<(const Node& n)const {
        return cost > n.cost;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

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

    vector<ll> d(n);
    vector<vector<Edge>> edge(n);
    priority_queue<Node> q;

    rep(i, m) {
        ll a, b, c; cin >> a >> b >> c;
        a--, b--;
        edge[a].emplace_back(Edge(b, c));
        edge[b].emplace_back(Edge(a, c));
    }

    ll W = 0, D = n + 1;

    ll l = 0, h = 2e9;
    while (h - l >= 1) {
        int mid = (l + h) / 2;
        rep(i, n) d[i] = INF;
        d[0] = 0;
        
        q.push(Node(0, 0));

        while (!q.empty()) {
            auto p = q.top(); q.pop();
            if (d[p.node] < p.cost) continue;
            for (auto e : edge[p.node]) {
                if (e.cost < mid) continue;
                if (d[e.to] > p.cost + 1) {
                    d[e.to] = p.cost + 1;
                    q.push(Node(e.to, d[e.to]));
                }
            }
        }

        if (d[n - 1] == INF) {
            h = mid;
        }
        else {
            l = mid + 1;
        }
    }
    rep(i, n) d[i] = INF;
    d[0] = 0;

    q.push(Node(0, 0));
    W = h - 1;

    while (!q.empty()) {
        auto p = q.top(); q.pop();
        if (d[p.node] < p.cost) continue;
        for (auto e : edge[p.node]) {
            if (e.cost < W) continue;
            if (d[e.to] > p.cost + 1) {
                d[e.to] = p.cost + 1;
                q.push(Node(e.to, d[e.to]));
            }
        }
    }
    cout << W << " " << d[n - 1] << endl;
}