You are given a directed weighted graph with nodes and edges. Find the shortest distance from node to every other node. If a node is unreachable, output .
Run Dijkstra from node . Store the distance array. Print the result for each node from to . Constraints: , , weights up to . Use long long for distances because the total path weight can exceed -bit range. This is the textbook Dijkstra problem with no hidden tricks.