#include <cstdio>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
struct dd
{
    int y,z;
}t;
vector<dd>v[100005];
int d[1000005],cnt=0;
int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    int n , m ,x , y,s,i,z;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        t.y=y;
        t.z=z;
        v[x].push_back(t);
    }
    queue<int>q;
    q.push(1);
    while(!q.empty())
    {
        int s=q.front();

        q.pop();
        for(i=0;i<v[s].size();i++)
            if(d[v[s][i].y]==0)
        {
            q.push(v[s][i].y);
            d[v[s][i].y]=d[s]+v[s][i].z;
        }
        else
        {
            if(d[v[s][i].y]>(d[s]+v[s][i].z))
            {
                d[v[s][i].y]=d[s]+v[s][i].z;
                q.push(v[s][i].y);
            }
        }
    }
    for(i=2;i<=n;i++)printf("%d ",d[i]);
return 0;
}