Abstract: Focusing on the limitation that existing multi-candidate e-voting methods do not support weighted voting, and following more efficient improvements to the Point Function Secret Sharing (PFSS) scheme that supports additionability, A weighted multi-candidate e-voting protocol based on the refined PFSS scheme was proposed. The votes of each voter and the weights of the votes are constituted as a point function, and the keys group of the point function was generated by using the PFSS technique, which was sent to p servers respectively. Upon completion of the voting process. The total votes received by each candidate were obtained by modular arithmetic operations according to the response vectors returned by the p servers.The correctness, security and efficiency of the protocol were analyzed, whic proves that it was secure and relatively efficient. and it is the first weighted multi-candidate e-voting method. Finally, A concrete example is provided illustrate the validity of the protocol. demonstrating that the protocol resolves the issue of current multi-candidate e-voting methods' inability to support weighted voting, and the practical applications of PFSS technology in distributed systems was expanded.