#include<fstream>
#include<queue>
using namespace std;

int n,m,i,x,y,val,a[1000][1000],dist[1000];
queue < pair < int,int > > q;

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

int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y>>val;
        a[x][y]=val;
    }

    for(i=2;i<=n;i++)
        dist[i]=2000000000;

    q.push(make_pair(1,0));

    while(!q.empty())
    {
        for(i=1;i<=n;i++)
        {
            if(a[q.front().first][i]!=0 && dist[i]>q.front().second+a[q.front().first][i])
            {
                dist[i]=q.front().second+a[q.front().first][i];
                q.push(make_pair(i,dist[i]));
            }
        }
        q.pop();
    }

    for(i=2;i<=n;i++)
        g<<dist[i]<<" ";

    f.close();
    g.close();
    return 0;
}