Which data structure is used in Prim's algorithm to efficiently select the next minimum-weight edge connecting to the growing MST?

Priority Queue

Prim's algorithm uses a priority queue (often a binary or Fibonacci heap) to store vertices not yet in the MST, keyed by their minimum distance to any vertex currently in the MST.