The p-energy of a k-vertex digraph D is defined by where are eigenvalues of D and and are respectively real and imaginary parts of the eigenvalue In the present paper, we consider a class of bicyclic digraphs such that each digraph in this class contains two vertex-disjoint directed cycles. We find digraphs in this class with extremal p-energy.