#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define nmax 50005
#define inf 2e9
using namespace std;

int n,m;
vector< pair<int,int> > g[nmax];
queue < pair<int,int> > q;
int d[nmax];

void read()
{
    scanf("%d %d",&n,&m);
    int a,b,c;
    for(int i=1;i<=m;i++)
    {
        scanf("%d %d %d",&a,&b,&c);
        g[a].push_back(make_pair(b,c));
    }
}

void solve()
{
    q.push(make_pair(1,0));
    for(int i=2;i<=n;i++)
        d[i]=inf;
    while(!q.empty())
    {
        int nod = q.front().first;
        q.pop();
        for(int i=0;i<g[nod].size();i++)
        {
            if(d[g[nod][i].first]>d[nod]+g[nod][i].second)
                {
                    d[g[nod][i].first]=d[nod]+g[nod][i].second;
                    q.push(make_pair(g[nod][i].first,d[g[nod][i].first]));
                }
        }
    }
    for(int i=2;i<=n;i++,printf(" "))
        if(d[i]!=inf)
            printf("%d",d[i]);
        else printf("0");
}
int main()
{

    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    read();
    solve();
    return 0;
}