#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

char*mmap();
#define rd(v) int v=0;{int _c;while(_c=*rp++-48,_c>=0)v=v*10+_c;}

#define WTHI(v) {long _z=v,_n=0,_d=0;while(++_n,_d=_d<<8|0x30|_z%10,_z/=10);*(long*)wp=_d;wp+=_n;}
#define WTLO(v) {long _z=v,_n=8,_d=0;while(_d=_d<<8|0x30|_z%10,_z/=10,--_n);*(long*)wp=_d;wp+=8;}
#define wt(v) if(v>=100000000){WTHI(v/100000000);WTLO(v);}else{WTHI(v);}

#define rep(v,e) for(int v=0;v<e;++v)

typedef struct {
	int s,t,d;
} Edge;
Edge es[200000];

// sort

void radix_sort_aux(Edge*a,Edge*b,int n){
	int c[256];
	for(int i=0;i<256;++i){
		c[i]=0;
	}
	for(int i=0;i<n;++i){
		++c[a[i].d&255];
	}
	int t=0;
	for(int i=256;i--;){
		int u=c[i];
		c[i]=t;
		t+=u;
	}
	for(int i=0;i<n;++i){
		int j=c[a[i].d&255]++;
		b[j].s=a[i].s;
		b[j].t=a[i].t;
		b[j].d=(unsigned)a[i].d>>8|(unsigned)a[i].d<<24;
	}
}

void radix_sort(Edge*a,int n){
	radix_sort_aux(a,a+n,n);
	radix_sort_aux(a+n,a,n);
	radix_sort_aux(a,a+n,n);
	radix_sort_aux(a+n,a,n);
}

// uf

#define UFSIZE 100000
int ufbuf[UFSIZE];
void uf_init(){
	for(int i=0;i<UFSIZE;++i){
		ufbuf[i]=-1;
	}
}
int uf_root(int a){
	int b;
	int t=a;
	while(b=ufbuf[t],b>=0) t=b;
	while(b=ufbuf[a],b>=0) ufbuf[a]=t,a=b;
	return t;
}
void uf_unite(int a,int b){
	a=uf_root(a);
	b=uf_root(b);
	if(a!=b){
		if(ufbuf[a]<ufbuf[b]){
			ufbuf[a]+=ufbuf[b];
			ufbuf[b]=a;
		}else{
			ufbuf[b]+=ufbuf[a];
			ufbuf[a]=b;
		}
	}
}

// graph

#define MAXN 100000
#define MAXM 200000
int en[MAXN];
int ei[MAXN];
int eb[MAXM];

//

typedef struct {
	int i,l;
} Q;
Q q[100000];
char vis[100000];

main(){
	char*rp=mmap(0l,1l<<28,1,2,0,0ll);
	char wbuf[64],*wp=wbuf;

	rd(n);
	rd(m);
	rep(i,m){
		rd(si); es[i].s=si-1;
		rd(ti); es[i].t=ti-1;
		rd(di); es[i].d=di;
	}
	radix_sort(es,m);
	int k=0;
	uf_init();
	while(uf_root(0)!=uf_root(n-1)){
		uf_unite(es[k].s,es[k].t);
		++k;
	}
	int limd=es[k-1].d;
	wt(limd);
	*wp++=32;
	while(k<m&&es[k].d==limd){
		++k;
	}

	for(int j=0;j<k;++j){
		++en[es[j].s];
		++en[es[j].t];
	}
	{
		int s=0;
		for(int i=0;i<n;++i){
			ei[i]=s;
			s+=en[i];
			en[i]=0;
		}
	}
	for(int j=0;j<k;++j){
		int s=es[j].s;
		int t=es[j].t;
		eb[ei[s]+en[s]++]=t;
		eb[ei[t]+en[t]++]=s;
	}

	int qw=0,qr=0;
	vis[n-1]=1;
	q[qw].i=n-1;
	q[qw].l=0;
	++qw;
	while(1){
		int i=q[qr].i;
		int l=q[qr].l;
		++qr;
		if(i==0){
			wt(l);
			write(1,wbuf,wp-wbuf);
			_exit(0);
		}
		rep(j,en[i]){
			int ii=eb[ei[i]+j];
			if(!vis[ii]){
				vis[ii]=1;
				q[qw].i=ii;
				q[qw].l=l+1;
				++qw;
			}
		}
	}
}