In　this　paper,　we　consider　a　variant　of　the　classical　uncapacitated　facility　location　problem,　so-called　squared　metric　two-stage　stochastic　facility　location　problem　(SM-2-SFLP)　which　can　treat　the　uncertainty　of　the　set　of　clients　and　facility　costs.　We　assume　that　the　connection　cost　is　squared　metric,　a　variant　of　the　metric　case　which　is　widely　researched.　We　give　a　new　0-1　integer　linear　programming　for　SM-2-SFLP.　Based　on　the　new　formulation,　we　apply　two　known　algorithms　to　SM-2-SFLP,　and　analyze　the　approximation　ratio　and　per-scenario　bound　respectively.