Steiner　tree　problem　is　a　typical　NP-hard　problems　in　combinatorial　optimization,　which　has　comprehensive　application　background　and　is　a　hot　topic　in　recent　years.　In　this　paper,　we　study　the　stochastic　prize-collecting　Steiner　tree　problem.　Before　the　actual　requirements　materialize,　we　can　choose　(purchase)　some　edges　in　the　first　stage.　When　actual　requirements　are　revealed,　drawn　from　a　prespecified　probability　distribution,　then　there　are　more　edges　may　be　chosen　(purchased)　for　the　actual　requirements.　The　goal　is　to　minimize　the　sum　of　the　first　stage　cost,　the　expected　second　stage　cost　and　the　expected　penalty　cost.　We　propose　a　primal-dual　3-approximation　algorithm　for　the　stochastic　prize-collecting　Steiner　tree　problem.