#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#define nmax 50005
#define cost first
#define vecin second
#define inf 0x3f3f3f3f

using namespace std;

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

void citire()
{
    int x,y,c;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&c);
        g[x].push_back(make_pair(c,y));
    }
    memset(d,inf,sizeof(d));
}

void dijkstra(int nod)
{
    d[nod]=0;
    q.push(make_pair(0,nod));
    int k;
    while(!q.empty())
    {
        k=q.top().vecin;
        q.pop();
        for(vector<pair<int,int> >::iterator ii=g[k].begin();ii!=g[k].end();++ii)
            if(d[ii->vecin]>ii->cost+d[k])
            {
                d[ii->vecin]=ii->cost+d[k];
                q.push(make_pair(-d[ii->vecin],ii->vecin));
            }
    }
}

void afisare()
{
    for(int i=2;i<=n;i++)
    {
        if(d[i]==inf)
            printf("0 ");
        else
            printf("%d ",d[i]);
    }
}

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    citire();
    dijkstra(1);
    afisare();
    return 0;
}