Is the union of computable enumerable sets computably enumerable
Every language can be written as a countable union of singletons $\{x\}$.
On the other hand, the union of finitely many c.e. languages is c.e.