#include <fstream>
#include <vector>
#include <algorithm>

#define INF 99999;

int n,m;
int distante;
int main() {
 fin>>n>>m;

 priority_queue <pair<int,int>,greater <int,int> q;
 vector<int>distante(n+1,10000);
  distante[0]=0;
  q.push(make_pair(0, 0));
  	while(!q.empty()) {
  		int u = q.top().second;
  		q.pop();
  	}

  	for(int i =0;i<n;i++) {
  			 int v = (*i).first;
            int cost = (*i).second;
            if(distante[v] > distante[u] + cost) {
            	distante[v] = distante[u] + cost;
            	q.push(make_pair(dist[v],v));
            }
  	}
  }