Making Heuristic State Space Search Optimal

Recall the example search tree shown below, along with the optimal path from A to J in blue.

Q: What is different about the two vertices representing J in the search tree?