#include <stdio.h>
#include <vector>
#define N 101
#define MAX 10000000
using namespace std;
struct E
{
int next; //与其直接相邻的下一个节点
int cost; //代表该边的权值
};
vector<E> edge[101];
bool visited[101];
int dist[101]; //节点v0到其他个节点的最短路径距离
int main()
{
int n, m;
while(scanf("%d%d", &n, &m) != EOF)
{
if(n == 0)
break;
for(int i = 0; i <= n; i++)
edge[i].clear();
//输入
int a, b, c;
for(int i = 1; i <= m; i++)
{
scanf("%d%d%d", &a, &b, &c);
E temp;
temp.cost = c;
temp.next = a;
edge[b].push_back(temp);
temp.next = b;
edge[a].push_back(temp);
}
//初始化
for(int i = 1; i <= n; i++)
{
dist[i] = -1;
visited[i] = false;
}
dist[1] = 0;
visited[1] = true;
int u = 1;
//循环 n-1次,每循环一次加入一个节点到最短路径集合
for(int k = 1; k < n; k++)
{
//更新与新加入的节点u直接相邻的节点的dist
for(int j = 0; j < edge[u].size(); j++)
{
int t = edge[u][j].next; //与u直接相邻的节点的编号t
int c = edge[u][j].cost; //u与t之间的权值
if(visited[t] == true)
continue;
//t不可达或者dist[t] < dist[u] + c
if(dist[t] == -1 || dist[t] > dist[u] + c)
dist[t] = dist[u] + c;
}
//寻找目前没有加入最短路径集合,且与v0的距离最短的节点编号u
int min = MAX;
for(int i = 1; i <= n; i++)
{
if(visited[i] == true)
continue;
if(dist[i] == -1)
continue;
if(dist[i] < min)
{
min = dist[i];
u = i;
}
}
visited[u] = true;
}
printf("%d\n", dist[n]);
}
}