#include <fstream>
#include <vector>
#include <set>

using namespace std;

ifstream in("dijkstra.in");
ofstream out("dijkstra.out");

int n,m;
int costx,nodx,costv,nodv;

set <pair<int,int>> sett;

vector <pair<int,int>> lista[100001];
int d[50001];

int main()
{
    in>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int n1,n2,cost;
        in>>n1>>n2>>cost;
        lista[n1].push_back(makepair(n2, cost));
    }
    for(int i=2;i<=n;i++)
    {
        d[i]=6000000000;
    }
    sett.insert(makepair(0,1));
    while(!sett.empty())
    {
        int costx=sett.begin()->first;
        int nodx=sett.begin()->second;
        sett.erase(s.begin());
        for(int i=0;i<lista.size();i++)
        {

        }
    }
    return 0;
}