this paper studies the polynomial optimization problem whose feasible set is a union of several basic closed semialgebraic sets. we propose a unified hierarchy of moment-sos relaxations to solve it globally. under some assumptions, we prove the asymptotic or finite convergence of the unified hierarchy. special properties for the univariate case are discussed. the numerical experiments demonstrate that solving this unified hierarchy takes less computational time than optimizing the objective over each individual constraining subset separately. the application for computing (p,q)-norms of matrices is also presented.