Let be a finite and simple digraph with vertex set ( ). A signed total Roman dominating function (STRDF) on a digraph is a function : ( ) → {−1, 1, 2} satisfying the conditions that (i) ∑ ) ≥ 1 for each ∈ ( ), where ) consists of all vertices of from which arcs go into , and (ii) every vertex for which ) = −1 has an inner neighbor for which ) = 2. The weight of an STRDF is ) = ∑ ). The signed total Roman domination number ) of is the minimum weight of an STRDF on . In this paper we initiate the study of the signed total Roman domination number of digraphs, and we present different bounds on ). In addition, we determine the signed total Roman domination number of some classes of digraphs. Some of our results are extensions of known properties of the signed total Roman domination number ) of graphs