  We address univariate root isolation when the polynomial's coefficients are
in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$
is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds
for $F$ and algorithmic and bit-complexity results for the problem of isolating
its roots. For the latter problem we follow a common approach based on
univariate root isolation algorithms. For the particular case where $F$ does
not have multiple roots, we achieve a bit-complexity in
$\tilde{\mathcal{O}}_B(n d^{2n+2}(d+n\tau))$, where $d$ is the total degree and
$\tau$ is the bitsize of the involved polynomials.In the general case we need
to enhance our algorithm with a preprocessing step that determines the number
of distinct roots of $F$. We follow a numerical, yet certified, approach that
has bit-complexity $\tilde{\mathcal{O}}_B(n^2d^{3n+3}\tau + n^3 d^{2n+4}\tau)$.
