Before revision:  In the second part, we show a polynomial-time algorithm that, given an undirected graph G and a pair of vertices (s,t), finds prioritized multi-criteria 2-disjoint (vertex/edge) shortest  paths between s and t.
After revision:  In the second part, we show a polynomial-time algorithm that, given an undirected graph G and a pair of vertices (s,t), finds prioritized multi-criteria 2-disjoint (vertex/edge) shortest secure paths between s and t.