#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
const int mod = 998244353;
const int Mod = 1000000007;
const long long INF = 1LL << 60;
using ll = long long;
using ld = long double;
#define v2d(type,H,W,name,value) vector<vector<type>> name(H,vector<type>(W,value));

using plli  = pair<ll ,int>;

struct Edge {
  int to;
  ll w;
  Edge(int to, ll w):to(to),w(w) {}
};

using Graph = vector<vector<Edge>>;

template<class T> bool chmin(T& a, T b){
  if (a>b){
    a=b;
    return true;
  }
  else return false;
}
template<class T> bool chmax(T& a, T b){
  if (a<b){
    a=b;
    return true;
  }
  else return false;
}





int main()
{
  int N,M,s;
  cin >> N >> M;
  s=0;

  Graph G(N+10);
  rep(i,M){
    int a,b,w;
    cin >> a >> b >> w;
    a--;b--;
    G[a].push_back(Edge(b,w));
    G[b].push_back(Edge(a,w));
  }

  vector<ll> dist(N+10,0);
  dist[s]=INF;

  //plli : pair<ll ,int>
  priority_queue<plli> que;
  que.push(make_pair(dist[s],s));

  while(!que.empty()){
    int v=que.top().second;
    ll d=que.top().first;
    que.pop();

    if(d<dist[v]) continue;
    //よって d>=dist[v]
    for(auto e:G[v]){
      if(min(e.w,d)>dist[e.to]){
        dist[e.to]=min(e.w,d);
        que.push(make_pair(dist[e.to],e.to));
      }
    }
  }

  cout << dist[N-1] << " ";

  ll max_w=dist[N-1];



  vector<ll> dist2(N,-1);
  dist2[0]=0;
  
  queue<int> que2;
  que2.push(0);

  while(!que2.empty()){

    int qf=que2.front();
    for(Edge e:G[qf]){
      if(e.w<max_w) continue;
      ll x=e.to;
      if(dist2[x]==-1){
        que2.push(x);
        dist2[x]=dist2[qf]+1;
      }
    }
    que2.pop();
  }

  cout << dist2[N-1] << endl;

}