#include<queue>
#include<fstream>
#include<vector>
#define mx 50005
#define inf (2<<30)-1
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector<int> v[mx],c[mx];
queue<int> q;
int n,cost[mx],m;
void citire()
{
    int i,x,y,co;
    fin>>n>>m;
    //cost.resize(n+1,0);
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>co;
        v[x].push_back(y);
        c[x].push_back(co);
    }
}
void dj()
{
    cost[1]=0;
    q.push(1);
    while(!q.empty())
    {
       int nod=q.front();
       q.pop();
        for(unsigned int i=0;i<v[nod].size();++i)
            if(cost[v[nod][i]]>c[nod][i]+cost[nod])
        {
            cost[v[nod][i]]=cost[nod]+c[nod][i];
            q.push(v[nod][i]);
        }
    }
}
int main()
{
    int i;
    citire();
        for(int i=1;i<=n;i++)
        cost[i]=inf;
    dj();
    for(int i=2;i<=n;i++)
    {
        if(cost[i]==inf)
            fout<<0<<" ";
        else fout<<cost[i]<<" ";
    }
    return 0;
}