#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <map>
#include <set>
#include <algorithm>
#include <ctime>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 510000;
ll dy[8] = {0,1,0,-1,1,-1,1,-1};
ll dx[8] = {1,0,-1,0,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
const int mod = 1e9 + 7;
//const int mod = 998244353;

template <typename T> struct Compress{
    vector<T> comp;

    Compress(vector<T> v) : comp(v){
        sort(comp.begin(), comp.end());
        comp.erase(unique(comp.begin(), comp.end()), comp.end());
    }

    ll get(T x){
        if(!binary_search(all(comp),x)) return -1;
        return lower_bound(comp.begin(), comp.end(), x) - comp.begin();
    }

    T operator[](int id){
        return comp[id];
    }

    ll siz(){
        return comp.size();
    }
};

int main(){
    ll n,m; cin >> n >> m;
    vector<vpl> G(n);
    vvl color(n);
    color[0].push_back(0);
    rep(i,m){
        int u,v,c; scanf("%d%d%d",&u,&v,&c);
        u--; v--;
        G[u].emplace_back(v,c);
        G[v].emplace_back(u,c);
        color[u].push_back(c);
        color[v].push_back(c);
    }
    vector<Compress<ll>> cmp;
    rep(i,n){
        Compress<ll> v(color[i]);
        cmp.push_back(v);
    }
    vvl d(n);
    rep(i,n){
        d[i].resize(cmp[i].siz(),linf);
    }
    vector<vvl> lis(n);
    rep(i,n){
        lis[i].resize(cmp[i].siz());
        for(int v=0; v<G[i].size(); v++){
            lis[i][cmp[i].get(G[i][v].second)].push_back(v);
        }
    }
    rep(i,n){
        for(auto &v : G[i]){
            v.second = cmp[v.first].get(v.second);
        }
    }
    d[0][0] = 0;
    vb visit(n,false);
    priority_queue<pair<ll,P>,vector<pair<ll,P>>,greater<pair<ll,P>>> pq;
    pq.emplace(0,P(0,0));
    int cnt = 0;
    while(!pq.empty()){
        auto p = pq.top(); pq.pop();
        int u = p.second.first;
        int col = cmp[u][p.second.second];
        int cid = p.second.second;
        if(d[u][cid] < p.first) continue;
        if(visit[u]){
            for(auto v : lis[u][cid]){
                P nx = G[u][v];
                if(d[nx.first][nx.second] > d[u][cid]){
                    d[nx.first][nx.second] = d[u][cid];
                    pq.emplace(d[nx.first][nx.second], nx);
                }
            }
        }else{
            for(auto v : G[u]){
                int plus = cmp[v.first][v.second] != col;
                if(d[v.first][v.second] > d[u][cid] + plus){
                    d[v.first][v.second] = d[u][cid] + plus;
                    pq.emplace(d[v.first][v.second], v);
                }
            }
        }
        visit[u] = true;
    }
    ll ans = linf;
    rep(i,cmp[n-1].siz()) chmin(ans, d[n-1][i]);
    if(ans == linf) cout << -1 << endl;
    else cout << ans << endl;
}


Measured memory_bytes: 65900