Can't figure out how to draw a maze using a minimum spanning tree in Java

So far I've been able to create an adjacency matrix so every node is connected to its neighbor and all the edges are randomly weighted. Then I have a method for finding the minimum spanning tree using the matrix, which outputs which nodes are connected. Now I need to use the MST to draw the maze, but I can't figure it out while keeping the maze 5x5.