#include <bits/stdc++.h>
using namespace std;
const int maxn=100005;
const int inf=100000008;
#define int long long
int n,m,head[maxn],edgesum=0;
struct edge{
int next,to,w;
}edge[maxn];
void add_edge(int from,int to,int w)
{
edge[++edgesum].next=head[from];
edge[edgesum].to=to;
edge[edgesum].w=w;
head[from]=edgesum;
}
priority_queue<pair<int,int>>q;
int dis[maxn],v[maxn],pre[maxn];
void dijkstra()
{
memset(dis,inf,sizeof(dis));
memset(v,0,sizeof(v));
dis[1]=0;
q.push(make_pair(0,1));
while(q.size())
{
int x=q.top().second;
q.pop();
if(v[x]) continue;
v[x]=1;
for(int i=head[x];i;i=edge[i].next)
{
if(dis[edge[i].to]>dis[x]+edge[i].w)
{
dis[edge[i].to]=(dis[x]+edge[i].w);
q.push(make_pair(-dis[edge[i].to],edge[i].to));
pre[edge[i].to]=x;
}
}
}
}
int flag=0;
void print(int x)
{
if((pre[x]==0&&flag==0)||x==0) return ;
flag=1;
print(pre[x]);
cout<<x<<" ";
}
signed main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int u,v,w;
cin>>u>>v>>w;
add_edge(u,v,w);
add_edge(v,u,w);
}
dijkstra();
print(n);
if(!flag) cout<<"-1";
return 0;
}