#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("dijkstra.in");
ofstream fout("dijkstra.out");
vector <pair <int,int> > A[1000001];
int n,m,p;
int R[1000001];
priority_queue <pair <int,int> > Q;
int main()
{
    fin>>m>>n;
    for(int i=1;i<=n;i++)
    {
        int a,b,c;
        fin>>a>>b>>c;
        A[a].push_back({c,b});
    }
    for(auto it:A[1])
        Q.push({-1*it.first,it.second});
    while(!Q.empty())
    {
        cout<<Q.top().first<<" "<<Q.top().second<<"\n";
        Q.pop();
    }
    R[1]=0;
    while(!Q.empty())
    {
        pair<int,int> nod=Q.top();
        Q.pop();
        int g=A[nod.second].size();
        for(int i=0;i<g;i++)
        {
            int s=A[nod][i];
            if(R[s]==-1)
            {
                R[s]=R[nod]+1;
                Q.push(s);
            }
        }

    }
    for(int i=1;i<=m;i++)
            fout<<R[i]<<" ";
    return 0;
}