How do I draw a minimum spanning tree when given the distance matrix?

Use an algorithm like prims algorithm

Thank you!
how would I know where the vertices go in relation to each other? say if the distance between A and B is 10:
Like B could be directly below A, it could be 30 degrees to its left, etc. surely it could be anywhere in a circle of radius 10 around A?

Pretty sure it doesn't matter. Just make it so that the edges don't cross over each other.
You can even draw it in the shape of a generic tree graph.