Five vertices are labeled 1, 2, 3, 4, 5. In how many ways can edges be drawn between some pairs of these vertices so that the result is a connected graph that is a tree?
