Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps