{

int ans = 0;

for (int i = 0; i < N; i++)

{

if (path[i] == -1)

continue;

ans += dist[i];

cout << path[i] << " - " << i << ": " << dist[i] << endl;

}

cout << "Weight of MST: " << ans << endl;

bool operator()(const pair <int, int>& a, const pair<int, int>& b)const {

return a.second > b.second;

}

{

priority_queue<pair<int, int>, vector<pair<int, int>>, option>pq;

pq.push(make_pair(src, 0));

dist[src] = 0;

while (!pq.empty())

{

int u = pq.top().first;

pq.pop();

visited[u] = true;

for (int i = 0; i < graph[u].size(); i++)

{

int v = graph[u][i].first;

int w = graph[u][i].second;

pair<int, int > neighbor = graph[u][i];

if (!visited[v] && dist[v] > w)

{

dist[v] = w;

pq.push(make_pair(v, w));

path[v] = u;

}

}

}

{

int M, u, v, w;

cin >> N >> M;

memset(path, -1, sizeof(path));

for (int i = 0; i < M; i++)

{

cin >> u >> v >> w;

graph[u].push_back(make_pair(v, w));

graph[v].push_back(make_pair(u, w));

}

int s = 0;

Prims(s);

printMST();

return 0;

}