Graph sampling is a challenging problem in network analysis due to the complex structures of networks. Currently, a series of graph sampling algorithms based on random walks achieve good results in graph sampling tasks. However, the existing methods often reduce the conductance of graphs, causing the sampler to stay in the same node for a long time. This results in undersampling. In this paper, we propose a novel Weighted Jump Random Walk (WJRW) algorithm to generate representative samples. We design a parameter in the WJRW algorithm that can adjust the proportions of random walk and random jump in every step. According to the issue of repeated sample nodes in the Generalized Maximum Degree (GMD) method and the problem of large deviations in the Simple Random Walk (SRW), WJRW addresses the weaknesses of the GMD method and enhances the diffusion of a random walker on graphs, leading to a more representative sample. Then, WJRW addresses the issue of large deviations in SRW and enhances the efficiency of the unbiased estimator. By generating smoother stationary distributions. Numerical experiments with extensive real-world networks verify that our method achieves higher accuracy than classical and state-of-the-art methods in estimating distribution estimation.