Zhen Lin Low's paper Universes for category theory (arXiv:https://arxiv.org/abs/1304.5227) is perhaps a great start. The abstract is:
There are also slidesslides of a talk by Low on the same topic that are a bit more ... accessible. I want to point out the concept of "weak universe" suggested at the end of the talk is more or less the same thing as some stage $V_\alpha$ in the cumulative hierarchy where $\alpha$ is some limit ordinal (and also not too different to a model of ETCS - although I'm deliberately being vague here). Such a $V_\alpha$ is a more general (weaker) notion than the $\mathbf{U}$ in your question. No results are given regarding weak universes, but keep them in mind for the rest of this answer.
From the point of view of algebraic geometry, the Stacks Project goes to great lengths to make sure everything is a set. In particular the proof of the Reflection principle is unwound (or reverse engineered) to show how instances of it apply in all the cases of interest for categorical constructions involving schemes. Note that the Reflection principle applies involves the sets $V_\alpha$ for limit $\alpha$, hence weak universes. The trick is to write down an explicit (super)exponential function $Bound$ in cardinals (like $\kappa^\kappa$ or $\kappa^{2^\kappa}$) that bounds the growth of the cardinality of the sets necessary to build the various scheme-theoretic constructions on wants, and then use this to show the (small!) category $Sch_\alpha := Sch_{V_\alpha}$ is closed under said constructions (see eg Tag 000R). So for example, one can get existence of pullbacks and $\leq\lambda$-sized colimits (for a regular cardinal $\lambda$ - the notes prove the case of $\lambda = \aleph_0$; a simple modification of the bounding function allows for larger but fixed $\lambda$). Also treated are sites, which of course need to be small to make sheaf categories locally small.
All of the above would be in vain, but for the fact that all the constructions one wants to show are in your small category of schemes are in fact performed in the large category $Sch$ of all schemes, and then the theorem shows that these are actually in the (essential) image of $Sch_\alpha \hookrightarrow Sch$, for some appropriate $\alpha$. Given any concrete problem at hand (for instance, discussing the geometry of the compactified moduli stack of $n$-pointed genus-$g$ curves) one only ever starts with a set's worth of data, and so there exists some limit ordinal $\alpha$ such that no consideration of anything other than $Sch_\alpha$ is necessary. In particular, not even full universes are needed in this instance, although using universes might make the book-keeping of the proofs simpler.
If you are more interested in differential geometry, then the category of all finite-dimensional manifolds (of your preferred flavour) is already essentially small. This is due to the Whitney embedding theorem.
From a topological point of view, many interesting categories of spaces (even if not excessively general) are already essentially small, while being closed under a reasonable class of (co)limits. For instance, second-countable paracompact Hausdorff spaces all embed in the Hilbert cube $[0,1]^{\aleph_0}$, hence the category of such is essentially small. Polish spaces are another example of spaces embeddable in the Hilbert cube. One could perform a similar analysis to the Stacks Project for topological spaces in any given setting to find out which constructions allow one to stay entirely within a small category.
Lastly, it should be worth pointing out that in the category of sets, one actually has reasonably canonical constructions of lots of things, for instance a limit can be given as a specific set of natural transformations, rather than just positing that such a set exists with some universal property. Likewise for colimits; given powersets (which in ZF(C) are unique, for instance) there is a construction of a colimit using Separation as a subset of an appropriate powerset. Then the universal property follows from the construction, so the comparison to arbitrary-sized sets is no longer a problem (in the sense that, going up a universe cannot destroy the universal property). Then for various categories of algebras for monads on $Set$, unless things are really weird (laptop is running low on battery, I've not time to remind myself if it's always ok: you might need the monad to have a http://zll22.user.srcf.net/dpmms/slides/2013-07-11-AccessibleAdjoints.pdfrank) these type of results lift, if I'm not mistaken.