#include <iostream>
#include <fstream>
#include <queue>
using namespace std;

ofstream fo("dijkstra.out");
ifstream fi("dijkstra.in");
struct arc
{
    int a,lungime;
};
int n,m,x1,x2,L;
int drum[50005];
vector<arc> vecini[50005];
priority_queue<int> coada;
arc citit;


int main()
{

    fi>>n>>m;

    for(int i=1; i<=m; i++)
    {
      fi>>x1>>x2>>L;
      citit.a=x2;
      citit.lungime=L;
      vecini[x1].push_back(citit);


    }







    return 0;
}