#include <bits/stdc++.h>
#include <fstream>
#define pii pair<int,int>

using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
int n,m;
const int inf=(1<<31)-1,N=5e4+5;
bitset<N> inq;
int d[N];
vector<pii> v[N];
void djk(int x0)
{
    for(int i=1;i<=n;i++)
        d[i]=inf;
    d[x0]=0;
    priority_queue <pii, vector<pii>, greater<pii>> q;
    q.push({0,x0});
    while(!q.empty())
    {
        int x=q.top().second;
        q.pop();
        if(inq[x])
           continue;
        inq[x]=true;
        for(auto it:v[x])
        {
            int y=it.first;
            int c=it.second;
            if(d[x]+c<d[y])
            {
                d[y]=d[x]+c;
                q.push({d[y],y});
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        if(i!=x0)
           {
               if(d[i]!=inf)
                  fout<<d[i]<<" ";
               else
                   fout<<"0 ";
           }
    }
}
int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y,c;
        fin>>x>>y>>c;
        v[x].push_back({y,c});
    }
    djk(1);
    return 0;
}