#include<bits/stdc++.h>
using namespace std;
#define e exp(1)
#define pi acos(-1)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define ll long long
#define ull unsigned long long
#define mem(a,b) memset(a,b,sizeof(a))
int gcd(int a,int b){return b?gcd(b,a%b):a;}
const int maxn=1e5+5;
int n,m;
struct qnode{
int v,dis;
qnode(int v=0,int dis=0):v(v),dis(dis) {}//起点,最短值
bool operator<(const qnode &r)const
{
return dis>r.dis;
}
};
struct Edge{
int v,w;
Edge(int v=0,int w=0):v(v),w(w) {} //邻接点,权值
};
vector<Edge> ve[maxn];
int d[maxn];
bool vis[maxn];
void addEdge(int u,int v,int w)
{
ve[u].push_back(Edge(v,w));
}
void dijkstra(int start)
{
mem(vis,false);
mem(d,inf);
priority_queue<qnode> q;
d[start]=0;
q.push(qnode(start,0));//从起点开始
qnode tmp;
while(!q.empty())
{
tmp = q.top();
q.pop();
int u=tmp.v;
if(vis[u])continue;
vis[u]=true;
for(int i=0; i<ve[u].size(); i++)
{
int v=ve[u][i].v;
int w=ve[u][i].w;
if(!vis[v]&&d[v]>d[u]+w)
{
d[v]=d[u]+w;
q.push(qnode(v,d[v]));
}
}
}
}
int main()
{
while(~scanf("%d%d",&n,&m),n)
{
for(int i=1; i<=n; i++)ve[i].clear();
for(int i=0; i<m; i++)
{
int u,v,w;scanf("%d%d%d",&u,&v,&w);
addEdge(u,v,w);//建边
addEdge(v,u,w);
}
dijkstra(1);
printf("%d\n",d[n]);
}
return 0;
}