#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using V = vector<ll>;
using VV = vector<V>;
using VVV = vector<VV>;
using VVVV = vector<VVV>;
using VVVVV = vector<VVVV>;
using VVVVVV = vector<VVVVV>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<VB>;
using P = pair<ll,ll>;
using M = map<ll,ll>;
using Q = queue<ll>;
using PQ = priority_queue<ll>;
using PQG = priority_queue<ll,V,greater<ll>>;
using S = set<ll>;
using VP = vector<P>;
const ll MOD = 1000000007;
const ll mod = 998244353;
const ll INF = 1LL << 60;
#define rep(i,n) for(ll i = 0; i < n; i++)
#define rep2(i,s,n) for(ll i = s; i < n; i++)
#define per(i,n) for(ll i = n-1; i >= 0; i--)
#define per2(i,s,n) for(ll i = n-1; i >= s; i--)
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
template<class T>void Vin(vector<T>&a){rep(i,(int)a.size())cin>>a[i];}
template<class T>void VVin(vector<vector<T>>&a){rep(i,(ll)a.size())Vin(a[i]);}
template<class T>void Vout(const vector<T>&a){rep(i,(int)a.size())cout<<a[i]<<endl;}
ll power(ll a,ll b,const ll&M){a%=M;ll res=1;while(b>0){if(b&1)res=res*a%M;a=a*a%M;b>>=1;}return res;}
const ll H[4] = {0,1,0,-1}, W[4] = {1,0,-1,0};

struct Edge {
    long long to, cost;
    Edge() {}
    Edge(long long to, long long cost): to(to), cost(cost) {}
};

void Dijkstra(vector<vector<Edge>> &G, long long s, vector<long long> &dis, vector<long long> &path) {
    priority_queue<pair<long long,long long>> pq;
    dis[s] = INF;
    pq.emplace(INF,s);
    while(!pq.empty()) {
        pair<long long,long long> p = pq.top();
        pq.pop();
        long long v = p.second;
        if(dis[v] > p.first) continue;
        for(Edge &e : G[v]) if(dis[e.to] < min(p.first,e.cost)) {
            dis[e.to] = min(p.first,e.cost);
            pq.emplace(dis[e.to],e.to);
            path[e.to] = v;
        }
    }
}

int main() {
  ll n, m;
  cin >> n >> m;
  vector<vector<Edge>> G(n);
  rep(i,m) {
    ll s, t, d;
    cin >> s >> t >> d;
    s--, t--;
    G[s].eb(t,d);
    G[t].eb(s,d);
  }
  V path(n,-1), dis(n,0);
  Dijkstra(G,0,dis,path);
  ll ans = 0, k = n-1;
  while(path[k] != -1) ans++, k = path[k];
  printf("%lld %lld\n",dis[n-1], ans);
}