#include <iostream>
#include <cstring>
#include <algorithm>
#include <map>
#include <queue>
using namespace std;
typedef pair<int, int> PII;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;
int h[N], e[N], w[N], ne[N], idx;
int dist[N];
bool st[N];
int n, m;
void add(int a, int b, int c) // 添加一条边a->b,边权为c
{
e[idx] = b, w[idx] = c, ne[idx] = h[a], h[a] = idx ++ ;
}
int dijkstra()
{
memset(dist, INF, sizeof dist);
dist[1] = 0;
priority_queue<PII, vector<PII>, greater<PII> > heap;
heap.push({0, 1}); //前面的是距离,后面是点的编号
while(heap.size())
{
PII tmp = heap.top();
heap.pop();
int point = tmp.second, distance = tmp.first;
//标记
if(st[point]) continue;
st[point] = true;
//更新
for(int i = h[point]; i != -1; i = ne[i])
{
int j = e[i];
int val = w[i];
if(dist[j] > dist[point] + val)
{
dist[j] = dist[point] + val;
heap.push({dist[j], j});
}
}
}
return dist[n] == INF? -1: dist[n];
}
int main()
{
int a, b, c;
scanf("%d%d", &n, &m);
memset(h, -1, sizeof h);
while (m -- )
{
scanf("%d%d%d", &a, &b, &c);
add(a, b, c);
}
cout << dijkstra() << endl;
return 0;
}