📝 **Task:** Find shortest distances from node 0 for n=4, edges=[(0,1,1),(0,2,4),(1,2,2),(1,3,5),(2,3,1)]. Print result. Expected: [0, 1, 3, 4] 📋 Edit the starter code. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.