For prim's algorithm, if a vertice have the same weight to other vertices, so which one will it be choosen to put in the tree?

For example

A to B is 3

A to C is 3

A to D is 3

B to C is 3

B to D is 3

C to D is 3

How will be a minimal spanning tree be form?