do this, we use the standard dipath $\overrightarrow{P_n}$, with arcs $(i,i+1)$, $1 \le i \le n-1$, and $n$ oriented trees $\overrightarrow{T_{x_i}}$, $1 \le i \le n$, such that each $\overrightarrow{T_{x_i}}$ contains a sink $x_i$. By Lemma \[tree\_sink\], each $\overrightarrow{T_{x_i}}$ has a $1$-page sink oriented book embedding, such that $x_i$ is the top vertex in the spine, with spine order $(x_i, \alpha_i)$. Embed $V(\overrightarrow{P_n})$ and $V(\overrightarrow{T_{x_i}})$, $1 \le i \le n$, into the spine of a book with spine order $(1,2,...,n,(x_n; \alpha_n), (x_{n-1}; \alpha_{n-1}),...,(x_1; \alpha_1))$ such that $1$ is the top vertex in the spine. Place all arcs in $A(\overrightarrow{P_n})$ into the spine, and place all arcs in $A(\overrightarrow{T_{x_i}})$, $1 \le i \le n$, into the interior of the page. Therefore we have a $1$-page oriented book embedding $\overrightarrow{P_n} \cup \bigcup_{i=1}^n \overrightarrow{T_{x_i}}$. We now identify each $x_i$ in $\overrightarrow{T_{x_i}}$ with $i$ in $\overrightarrow{P_n}$, changing the spine order to $(x_1=1,x_2=2,...,x_n=n, \alpha_n, \alpha_{n-1},..., \alpha_1)$, as shown in Figure \[fig: fnt\_tree\] for $n=2$. This does not increase the number of pages required, since for $1 \le i \le n$, each set of arcs with head $x_i$ will be nested inside the set of arcs with head $x_{i-1}$. This yields an oriented tree containing an 