// 二分探索解だが WA になってほしい
#include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;

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

    int N, M;
    cin >> N >> M;
    vector<vector<pair<int, int>>> to(N);
    vector<int> ds;
    for (int e = 0; e < M; e++) {
        int s, t, d;
        cin >> s >> t >> d;
        s--, t--;
        to[s].emplace_back(t, d);
        to[t].emplace_back(s, d);
        ds.push_back(d);
    }

    sort(ds.begin(), ds.end());
    // ds.erase(unique(ds.begin(), ds.end()), ds.end());
    int ok = 0, ng = ds.size() - 1; // 間違える WAになってほしい

    auto solve = [&](int th) -> int {
        vector<int> dist(N, 1 << 30);
        dist[0] = 0;
        queue<int> q;
        q.push(0);
        while (!q.empty()) {
            int now = q.front();
            q.pop();
            for (auto [nxt, w] : to[now]) {
                if (w >= th and dist[nxt] > dist[now] + 1) {
                    dist[nxt] = dist[now] + 1;
                    q.push(nxt);
                }
            }
        }
        return dist.back();
    };

    while (ng - ok > 1) {
        const int c = (ok + ng) / 2;
        auto ret = solve(ds[c]);
        (ret == 1 << 30 ? ng : ok) = c;
    }
    cout << ds[ok] << ' ' << solve(ds[ok]) << '\n';
}