//Nguyen Huu Hoang Minh
#include <bits/stdc++.h>
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define reset(x) memset(x, 0,sizeof(x))
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define N 100005
#define remain(x) if (x > MOD) x -= MOD
#define ii pair<int, int>
#define iiii pair< ii , ii >
#define viiii vector< iiii >
#define vi vector<int>
#define vii vector< ii >
#define bit(x, i) (((x) >> (i)) & 1)
#define Task "test"
#define int long long

using namespace std;

typedef long double ld;
const int inf = 1e18;
const int minf = -1e10;

int n, m;
vector<ii> a[N];
int d[N];
int trace[N];

void readfile()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    if (fopen(Task".inp","r"))
    {
        freopen(Task".inp","r",stdin);
        //freopen(Task".out","w",stdout);
    }
    cin >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int u, v, z;
        cin >> u >> v >> z;
        a[u].pb(ii(v,z));
        a[v].pb(ii(u,z));
    }
}

void dijkstra()
{
    priority_queue<ii, vii, greater<ii>> q;
    q.push(ii(0,1));
    for(int i=1; i<=n; i++) d[i] = inf;
    d[1] = 0;
    while (q.size())
    {
        int u = q.top().se;
        int du = q.top().fi;
        q.pop();
        if (du != d[u]) continue;
        for(auto i : a[u])
        {
            int v = i.fi;
            int uv = i.se;
            if (d[v] > d[u] + uv)
            {
                d[v] = d[u] + uv;
                trace[v] = u;
                q.push(ii(d[v],v));
            }
        }
    }
}

void traceback()
{
    int s = n;
    stack<int> st;
    st.push(s);
    while (trace[s] != 0)
    {
        s = trace[s];
        st.push(s);
    }
    while (st.size())
    {
        cout << st.top() << ' ';
        st.pop();
    }
}

void proc()
{
    dijkstra();
    if (d[n]==inf) cout << -1;
    else traceback();
}

signed main()
{
    readfile();
    proc();
    return 0;
}