Let $G=(V,E)$ be a graph. A subset $D$ of $V$ is a \textit{restrained dominating set} if every vertex in $V \setminus D$ is adjacent to a vertex in $D$ and to a vertex in $V \setminus D$. The \textit{restrained domination number}, denoted by $γ_r(G)$, is the smallest cardinality of a restrained dominating set of $G$. A function $f : V \rightarrow \{0, 1, 2\}$ is a \textit{restrained Italian dominating function} on $G$ if (i) for each vertex $v \in V$ for which $f(v)=0$, it holds that $\sum_{u \in N_G(v)} f(u) \geq 2$, (ii) the subgraph induced by $\{v \in V \mid f(v)=0 \}$ has no isolated vertices. The \textit{restrained Italian domination number}, denoted by $γ_{rI}(G)$, is the minimum weight taken over all restrained Italian dominating functions of $G$. It is known that $γ_r(G) \leq γ_{rI}(G) \leq 2γ_r(G)$ for any graph $G$. In this paper, we characterize the trees $T$ for which $γ_r(T) = γ_{rI}(T)$, and we also characterize the trees $T$ for which $γ_{rI}(T) = 2γ_r(T)$.