The shortest disjoint paths problem

For any fixed $k$, we show the existence of a polynomial-time algorithm deciding if, given a graph $G$ and a set of pairs of vertices $(s_1, t_1), \dots, (s_k, t_k)$, there exist $k$ vertex-disjoint paths from $s_i$ to $t_i$ such that each of these paths is a shortest path.