#include <bits/stdc++.h>
#define INF 1e9
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m,x,y,cost,minim,p,viz[50005],d[50005];
vector<pair<int,int>> a[50005];
void dijkstra(int start)
{
    priority_queue<
    pair<int,int>,
    vector<pair<int,int>>,
    greater<pair<int,int>>
> pq;
    pq.push({0,start});
    for(int i=1;i<=n;i++)
        d[i]=INF;
    d[start]=0;
    while(!pq.empty())
     {

        int dist=pq.top().first;
        int nod=pq.top().second;
        pq.pop();
        if(dist!=d[nod]) continue;
            for(auto v:a[nod])
            {
                int vecin=v.first;
                int cost=v.second;
                if(d[vecin]>d[nod]+cost)
                {
                    d[vecin]=d[nod]+cost;
                    pq.push({d[vecin],vecin});
                }

            }

    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        a[x].push_back({y,cost});
    }
    dijkstra(1);
    for(int i=2;i<=n;i++)
    {
        if(d[i]==INF) fout<<0<<" ";
        else fout<<d[i]<<" ";
    }
    return 0;
}