Here's another way to see the answer: The Baldwin-Lachlan theorem says that a theory $T$ in a countable language is uncountably categorical if and only if it is $\omega$-stable and has no Vaughtian pairs, and both of these conditions are clearly preserved under naming countably many constants.
Of course, tomasz's method is better, since it shows that you can name $\kappa$ many constants, and the resulting theory will still be $\lambda$-categorical for all $\lambda > \kappa$.