#include <bits/stdc++.h>

using namespace std;

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");

const int NMAX = 50005;
const int INF = (1<<29);

int d[NMAX];
int fix[NMAX];
vector < pair<int,int> > a[NMAX];
priority_queue < pair<int,int> > q;
int n,m;

void dijkstra()
{
    for(int i=1;i<=n;i++) d[i]=INF;
    d[1]=0;
    q.push(make_pair(0,1));
    while(!q.empty())
    {
        while(!q.empty() and fix[q.top().second])
            q.pop();
        if(q.empty()) return;
        int node=q.top().second;
        fix[node]=true;
        for(int i=0;i<a[node].size();i++)
        {
            int vecin=a[node][i].first;
            int lg=a[node][i].second;
            if(d[vecin]>d[node]+lg)
                d[vecin]=d[node]+lg;
            q.push(make_pair(-d[vecin],vecin));
        }
    }
}
int main()
{
    fin >> n >> m;
    int x,y,c;
    for(int i=1;i<=m;i++)
    {
        fin >> x >> y >> c;
        a[x].push_back(make_pair(y,c)); /// {y,c};
    }
    dijkstra();
    for(int i=2;i<=n;i++)
    {
        if(d[i]!=INF) fout << d[i] << ' ';
        else fout << 0 << ' ';
    }
    return 0;
}