#include <bits/stdc++.h>
#define N 50005
#define M 250005
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<pair<int,int>>g[N];
int n,m;
int x,y,c;
int tata[N],d[N];

struct ordo{
    bool operator()(int a,int b){
        return d[a]>d[b];
    }
};

priority_queue<int,vector<int>,ordo>q;
bool S[N]; ///daca un element este sau nu in coada
void Dijkstra(int s) ///s=sursa
{
    for(int i=1; i<=n; i++)
        d[i]=2e9,tata[i]=0;
    d[s]=0;
    q.emplace(s);
    S[s]=1;
    while(!q.empty())
    {
        int u;
        u=q.top();
        q.pop();
        S[u]=0;
        for(auto next:g[u])
        {
            int v=next.first;
            int w=next.second;
            if(d[u]+w<d[v]) {
                d[v]=d[u]+w;
                tata[v]=u;
                if(!S[v]) q.emplace(v), S[v]=1;
            }
        }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        fin>>x>>y>>c;
        g[x].push_back({y,c});
    }
    Dijkstra(1);
    for(int i=2; i<=n; i++)
        if(d[i]!=2e9) fout<<d[i]<<" ";
        else fout<<0<<" ";
    return 0;
}