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

using namespace std;

vector<pair<int,int> >g[50002];
queue<int> q;
bool fol[50002];
int dmin[50002],i,n,m,x,y,z,nod;

int main()
{
    freopen("dijkstra.in","r",stdin);
    freopen("dijkstra.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++)
    {
        scanf("%d%d%d",&x,&y,&z);
        g[x].push_back({y,z});
    }
    memset(fol,false,sizeof(fol));
    memset(dmin,0x3f3f3f3f,sizeof(dmin));
    dmin[1]=0;
    fol[1]=true;
    q.push(1);
    while(q.size())
    {
        nod=q.front();
        q.pop();
        fol[nod]=false;
        for(vector<pair<int,int> >::iterator it=g[nod].begin();it!=g[nod].end();it++)
        {
            if(dmin[nod]+it->second<dmin[it->first])
            {
                dmin[it->first]=dmin[nod]+it->second;
                if(!fol[it->first])
                {
                    q.push(it->first);
                    fol[it->first]=true;
                }
            }
        }
    }
    for(i=2;i<=n;i++)
    {
        if(dmin[i]!=0x3f3f3f3f)
        {
            printf("%d ",dmin[i]);
        }
        else
        {
            printf("0 ");
        }
    }
    return 0;
}