#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; (i) < (int)(n); ++(i))
#define REP3(i, m, n) for (int i = (m); (i) < (int)(n); ++(i))
#define REP_R(i, n) for (int i = (int)(n)-1; (i) >= 0; --(i))
#define REP3R(i, m, n) for (int i = (int)(n)-1; (i) >= (int)(m); --(i))
#define ALL(x) ::std::begin(x), ::std::end(x)
using namespace std;
template <class T> using reversed_priority_queue = priority_queue<T, vector<T>, greater<T> >;

pair<int64_t, int> solve(int n, int m, const vector<int>& s, const vector<int>& t, const vector<int64_t>& d) {
    vector<vector<pair<int, int64_t> > > g(n);
    REP (i, m) {
        g[s[i]].emplace_back(t[i], d[i]);
        g[t[i]].emplace_back(s[i], d[i]);
    }

    // Dijkstra 1
    int64_t w;
    {
        vector<int64_t> dist(n, INT_MIN);
        priority_queue<pair<int64_t, int> > que;
        dist[0] = INT_MAX;
        que.emplace(INT_MAX, 0);
        while (not que.empty()) {
            auto [dist_x, x] = que.top();
            que.pop();
            if (dist_x < dist[x]) {
                continue;
            }
            for (auto [y, c] : g[x]) {
                if (dist[y] < min(dist_x, c)) {
                    dist[y] = min(dist_x, c);
                    que.emplace(dist[y], y);
                }
            }
        }
        w = dist[n - 1];
    }

    // Dijkstra 2
    int cnt;
    {
        vector<int> dist(n, INT_MAX);
        reversed_priority_queue<pair<int, int> > que;
        dist[0] = 0;
        que.emplace(0, 0);
        while (not que.empty()) {
            auto [dist_x, x] = que.top();
            que.pop();
            if (dist[x] < dist_x) {
                continue;
            }
            for (auto [y, c] : g[x]) {
                if (c < w) {
                    continue;
                }
                if (dist_x + 1 < dist[y]) {
                    dist[y] = dist_x + 1;
                    que.emplace(dist[y], y);
                }
            }
        }
        cnt = dist[n - 1];
    }

    return {w, cnt};
}

// generated by oj-template v4.7.2 (https://github.com/online-judge-tools/template-generator)
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    constexpr char endl = '\n';
    int n;
    int m;
    cin >> n >> m;
    vector<int> s(m), t(m);
    vector<int64_t> d(m);
    REP (i, m) {
        cin >> s[i] >> t[i] >> d[i];
        -- s[i];
        -- t[i];
    }
    auto [c, e] = solve(n, m, s, t, d);
    cout << c << ' ' << e << endl;
    return 0;
}