  We study upward planar straight-line drawings that use only three different
slopes. We show that deciding whether a digraph admits such a drawing is
NP-hard already for embedded outerplanar digraphs, though linear-time solvable
for trees with and without given embedding.
