#include <fstream>
#include <vector>
#include <set>

using namespace std;

ifstream cin ("dijkstra.in");
ofstream cout ("dijkstra.out");

long long int t,n,i,j,k,m,x,y,a,b,c,d[300005],ok[300005],u,v,w,sum,l,r,mini,nr,maxi,curr;
const int MOD=1e9+7;
vector<pair<int,int>>graf[300005];
set<pair<int,int>>s;

void dijkstra()
{
    d[1]=0;
    s.insert({0,1});
    while(!s.empty())
    {

        set<pair<int,int>> :: iterator it=s.begin();
        curr=it->second;
        s.erase(it);
        if(ok[curr]==1)
            continue;
        ok[curr]=1;
        for(i=0;i<graf[curr].size();i++)
        {

            c=graf[curr][i].first;
            x=graf[curr][i].second;
            if(ok[x]==0 && d[curr]+c<d[x])
            {
                d[x]=d[curr]+c;
                s.insert({d[x],x});
            }
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>m;
    for(i=1; i<=n; i++)
        d[i]=1e9;
    for(i=1; i<=m; i++)
    {
        cin>>u>>v>>c;
        graf[u].push_back({c,v});
    }
    dijkstra();
    for(i=2; i<=n; i++)
    {
        if(d[i]==1e9)
            d[i]=0;
        cout<<d[i]<<' ';
    }
    return 0;
}