Before revision:  We prove that the two variants of Multistage s-t Path are already NP-hard for an input sequence of only two graphs  .
After revision:  We prove that the two variants of Multistage s-t Path are already NP-hard for an input sequence of only two graphs and maximum vertex degree four .