Addendum 2: Letting $g(a_1,\dots,a_n):=Ef(U_n)$, we see that the function $g$ is symmetric and convex, and hence Schur convex -- see e.g. Theorem A on p. 258. So, in view of condition (0), \begin{equation*} Ef(U_n)\ge g(1/n,\dots,1/n)=\frac1{n^m}. \end{equation*}\begin{equation*} Ef(U_n)\ge g(1/n,\dots,1/n)=\frac1{n^m}. \tag{$\clubsuit$} \end{equation*} That is, the smallest value of $Ef(U_n)$ is attained in Case 2 ($a_1=\cdots=a_n=1/n$), considered above.
Addendum 3: For completeness, consider also the case when $m$ is fixed (even though $m\to\infty$ in the OP). Then, by (2), \begin{equation*} Ef(U_n)\sim\frac1{n^m}\,\prod_{r=0}^{m-1}\Big(1+\frac{2r}k\Big) \end{equation*} if $a_1=\cdots=a_k=1/k$ and $a_{k+1}=\cdots=a_n=0$ for a fixed natural $k\in[2,n-1]$ and $n\to\infty$. We see that, even when $m$ is fixed, the asymptotics depends on $k$ and, more generally, on how much the $a_j$'s differ from one another.
Addendum 4: Here we complement the lower bound on $Ef(U_n)$ given by ($\clubsuit$) in Addendum 2 by providing a matching upper bound on $Ef(U_n)$ that implies the following:
If the $a_i$'s are uniformly small in the sense that \begin{equation*} a:=\max_{i=1}^n a_i\to0 \end{equation*} and, moreover, $m$ is at most moderately large in the sense that \begin{equation*} m^3 a\to0, \tag{4} \end{equation*} then \begin{equation*} Ef(U_n)\sim\frac1{n^m} \tag{$\heartsuit$} \end{equation*} (as $n\to\infty$).
Indeed, the random point $(x_1^2,\dots,x_n^2)$ has the Dirichlet distribution with parameters $1/n,\dots,1/n$, and the Dirichlet distribution has the negative association (NA) property. So, by (say) Theorem 2, \begin{equation*} Ef(U_n)\le E\Big(\sum_{j=1}^n a_j Y_j\Big)^m, \tag{5} \end{equation*} where the $Y_j$'s are iid random variables each with the beta distribution with parameters $1/2,(n-1)/2$. Denoting now the $L^m$ norm by $\|\cdot\|_m$ and using Minkowski's inequality, we get \begin{equation*} (Ef(U_n))^{1/m}\le\Big\|\sum_{j=1}^n a_j Y_j\Big\|_m \le \Big\|\sum_{j=1}^n a_j EY_j\Big\|_m +\Big\|\sum_{j=1}^n a_j Z_j\Big\|_m, \end{equation*} where $Z_j:=Y_j-EY_j$. Since $EY_j=1/n$, we have \begin{equation*} \Big\|\sum_{j=1}^n a_j EY_j\Big\|_m = \sum_{j=1}^n a_j EY_j=\frac1n. \tag{6} \end{equation*} Note also that $Var\,Y_j\sim2/n^2$ and $\|Z_j\|_m\le2\|Y_j\|_m\ll m/n$; here and in what follows, $A\ll B$ means $A\le CB$ for some universal real constant $C>0$. Using now an appropriate version of Rosenthal's inequality (see e.g. Theorem 6.1), we get \begin{equation*} \begin{aligned} \Big\|\sum_{j=1}^n a_j Z_j\Big\|_m &\ll\frac1n\,(m^2 a^{1-1/m}+m^{1/2} a^{1/2}) \\ &=\frac1n\,\frac1m\,((m^3 a)^{1-1/m}m^{3/m}+(m^3 a)^{1/2}) =o\Big(\frac1n\,\frac1m\Big), \end{aligned} \end{equation*} by (4). So, by (5) and (6), \begin{equation*} (Ef(U_n))\le\frac1{n^m}\Big(1+\frac{o(1)}m\Big)^m =\frac{1+o(1)}{n^m}. \end{equation*} Now ($\heartsuit$) follows, in view of ($\clubsuit$).