#include <cstdio>
#include <cstring>
#include <vector>
#include <queue>

#define NMAX 50005
#define INF 0x3f3f3f3f
#define vecin second
#define cost first

using namespace std;

int n,m;
int d[NMAX];

vector<pair<int,int> > g[NMAX];

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

void dijkstra(int k)
{
    priority_queue<pair<int,int> > h;
    vector<pair<int,int> >::iterator it;
    d[k]=0;
    h.push(make_pair(0,k));
    while(!h.empty())
    {
        k=h.top().vecin;
        h.pop();
        for(it=g[k].begin();it!=g[k].end();++it)
            if(d[it->vecin]>d[k]+it->cost)
            {
                d[it->vecin]=d[k]+it->cost;
                h.push(make_pair(-d[it->vecin],it->vecin));
            }
    }
    for(int i=2;i<=n;++i)
        if(d[i]!=INF)
            printf("%d ",d[i]);
        else
            printf("0 ");
}

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