#include <fstream>
#include <vector>
#include <queue>
#include <bitset>
#include <cstring>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
const int N=50001,inf=0x3f3f3f3f;
struct nod
{
    int x,cost;
};
vector<nod>H[N];
vector<nod>::iterator it;
int dist[3*N];
struct comp
{
    bool operator() (const int &A,const int &B)
    {
        return dist[A]>dist[B];
    }
};
priority_queue <int, vector<int> , comp> Q;
int main()
{
    int n,m,a,i;
    nod A;
    fin>>n>>m;
    memset(dist,inf,sizeof(dist));
    for(i=1;i<=m;i++)
    {
        fin>>a>>A.x>>A.cost;
        H[a].push_back(A);
    }
    Q.push(1);
    dist[1]=0;
    while(Q.size())
    {
        a=Q.top();
        Q.pop();
        for(it=H[a].begin();it!=H[a].end();it++)
        {
            if(dist[it->x]>dist[a]+it->cost)
            {
                dist[it->x]=dist[a]+it->cost;
                Q.push(it->x);
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dist[i]==inf) fout<<"0 ";
        else fout<<dist[i]<<" ";
    }
}