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

ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");


int n,m,a,b,c,i,aux;
pair<int,int> x;
vector<pair<int,int> > v[50010];
queue<int> q;
int dist[50010];

int main()
{
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>a>>b>>c;
        v[a].push_back(make_pair(b,c));
        //v[b].push_back(make_pair(a,c));
    }
    for(i=2;i<=n;++i)
            dist[i]=1<<30;
    q.push(1);
    while(!q.empty())
    {
        aux=q.front();
        q.pop();
        for(i=0;i<v[aux].size();++i)
        {
            x=v[aux][i];
            if(dist[x.first]>dist[aux]+x.second)
            {
                dist[x.first]=dist[aux]+x.second;
                q.push(x.first);
            }
        }
    }
    for(i=2;i<=n;++i)
        if(dist[i]==1<<30)
        fout<<"0 \n";
    else
        fout<<dist[i]<<" ";


    return 0;
}