In the domain of Wireless Sensor Networks (WSN) the primary issue is the power awareness. The major energy resources of Wireless Sensor Networks are small batteries of the sensor nodes. These small batteries have limited energy. Generally, the users are unable to access these small sensor nodes once they are deployed. Hence it is impossible to replace these energy resources. To enhance the lifetime of network, energy efficiency is the main design issue to be handled carefully. Most energy dissipation occurs during communication, thus routing protocols in Wireless Sensor Networks mainly focus and strive to minimize the energy utilization. A number of protocols have been developed for Hierarchical Networks Routing aimed at minimizing the energy utilization and at prolonging the network life. However, there still is a need for enhanced protocols to further improve the lifetime of the network. To that end, a new technique called Shortest Path Tree Scaling Hierarchical Power Efficient Routing (SPTSHPER) for WSN is proposed in this work. In the SPTSHPER, the network operations are divided into two phases. These phases are zone setup phase and data communication phase. In zone setup phase, first network is divided into sub zones called clusters, and a node is selected as a representative node called Cluster Head (CH). In data communication phase, the actual transmission of data between nodes to Cluster Head and Cluster Head to the Base Station (BS) occurs. Dijkstra?s Algorithm is used to find the Shortest Path Trees (SPT) rooted at Base Station to all other cluster heads. In this way, sensor data is transmitted to Base Station by Shortest Path Tree. To prolong the lifetime of the network and to save average energy the SPTSHPER evenly distributes the energy dissipation among all the sensor nodes. The novelty of the proposed protocol lies in the use of both single-hop and multi-hop routing. In multi-hop routing it uses the Shortest Path Trees to communicate with the BS. The significant advantage of the proposed approach is that the network scalability is preserved by using both single-hop and multi-hop routing. Moreover, by using Dijkstra?s Algorithm the SPTSHPER can save energy and reduce delay of the data package among Cluster Heads and Base Station.