Trees · Easy problem

A planner wants to connect $7$ distinguishable neighborhoods with a road network that has no redundant loops and reaches every neighborhood. By Cayley's Formula, how many different such labeled road networks are possible?