#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
typedef pair<P,ll> PP;

int p[100001],r[100001];
void init(){rep(i,100001)p[i]=i,r[i]=0;}
int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));}
void unite(int x,int y) {
  x=find(x),y=find(y);
  if(x==y)return;
  if(r[x]<r[y])p[x]=y;
  else{p[y]=x;if(r[x]==r[y])r[x]++;}
}
bool same(int x,int y){return find(x)==find(y);}

void Main() {
  ll n,m;
  cin >> n >> m;
  vector<P> v[m];
  PP a[m];
  rep(i,m) {
    cin >> a[i].F.F >> a[i].F.S >> a[i].S;
    a[i].F.F--,a[i].F.S--;
    v[a[i].F.F].pb(P(a[i].F.S,a[i].S));
    v[a[i].F.S].pb(P(a[i].F.F,a[i].S));
  }
  ll l=0,r=MAX;
  while(l+1<r) {
    ll mm=(l+r)/2;
    init();
    rep(i,m) {
      if(a[i].S>=mm) unite(a[i].F.F,a[i].F.S);
    }
    if(same(0,n-1)) l=mm;
    else r=mm;
  }
  ll d[n];
  fill(d,d+n,MAX);
  d[0]=0;
  queue<ll> que;
  que.push(0);
  while(!que.empty()) {
    ll x=que.front();que.pop();
    rep(i,v[x].size()) {
      ll y=v[x][i].F;
      if(d[y]!=MAX||v[x][i].S<l) continue;
      d[y]=d[x]+1;
      que.push(y);
    }
  }
  pr(l,d[n-1]);
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}