#include <fstream>
#include <vector>
#include <queue>
#include <climits>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,c,Min;
int d[50001],nr[50001];
bool viz[50001];
struct cmp
{
    bool operator() (const int &a, const int &b)const
    {
        return d[a]>d[b];
    }
};
vector< pair <int,int> >g[50001];
priority_queue<int, vector <int>, cmp> h;
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>c;
        g[x].push_back(make_pair(y,c));
    }
    for(int i=2;i<=n;i++)
        d[i]=INT_MAX;
    h.push(1);
    while(!h.empty())
    {
        if(viz[h.top()]==1)
        {
            h.pop();
            continue;
        }
        int nod=h.top();
        viz[nod]=1;
        h.pop();

        for(int j=0;j<g[nod].size();j++)
        {
            int v=g[nod][j].first;
            int c=g[nod][j].second;
            if(viz[v]==0&&d[v]>d[nod]+c)
            {
                d[v]=d[nod]+c;
                h.push(v);
                viz[v]=0;
            }

        }
    }

    for(int i=2;i<=n;i++)
        if(d[i]==INT_MAX)
            fout<<"0 ";
        else
            fout<<d[i]<<' ';
    return 0;
}