In Part I of this series, we introduced a class of notions of forcing which we call Σ-Prikry, and showed that many of the known Prikry-type notions of forcing that centers around singular cardinals of countable cofinality are Σ-Prikry. We proved that given a Σ-Prikry poset P and a P-name for a non-reflecting stationary set T , there exists a corresponding Σ-Prikry poset that projects to P and kills the stationarity of T . In this paper, we develop a general scheme for iterating Σ-Prikry posets, as well as verify that the Extender Based Prikry Forcing is Σ-Prikry. As an application, we blow up the power of a countable limit of Laver-indestructible supercompact cardinals, and then iteratively kill all non-reflecting stationary subsets of its successor, yielding a model in which the singular cardinal hypothesis fails and simultaneous reflection of finite families of stationary sets holds.