#include <fstream>
#include <climits>
#include <vector>
using namespace std;

ifstream f("dijkstra.in");
ofstream g("dijkstra.out");

vector <int> a[50010];
vector <int> d[50010];

int n,D[50010],viz[50010];

void dijkstra (int s)
{
    int i,mini,x,k;
    for(i=1; i<=n; i++)D[i]=INT_MAX/2;
    D[s]=0;

    for(k=1; k<=n; k++)
    {

        mini=INT_MAX;
        x=0;
        for(i=1; i<=n; i++)
            if(viz[i]==0&&D[i]<mini)
            {
                mini=D[i];
                x=i;
            }

        if(x!=0)
        {
            viz[x]=1;
            for(i=0; i<a[x].size(); i++)
            {
                if(D[x]+d[x][i]<D[a[x][i]])D[a[x][i]]=D[x]+d[x][i];
            }

        }

    }
}



int m,x,y,val,i;
int main()
{
    f>>n>>m;

    for(i=1;i<=n;i++)
        D[i]=INT_MAX/2;


    for(i=1; i<=m; i++)
    {
        f>>x>>y>>val;
        a[x].push_back(y);
        d[x].push_back(val);
    }
    dijkstra(1);

    for(i=2;i<=n;i++)
        if(D[i]==INT_MAX/2)g<<0<<" ";
        else g<<D[i]<<" ";
    return 0;
}