The present article deals with the expanded minium-spanning tree problem. We, at the same time, take the costs and capacities into consideration. The costs and capacities have different meanings according to different situation. The capacities are required to be as large as possible, while the costs are needed to be as low as possible. To solve this problem, the authors present an efficient polynomial-time algorithm.