Before revision:  Our result also generalizes the known result that for every k\geq 1 and s\geq 0, List k-Colouring is polynomial-time solvable for (sP_1+P_5)-free graphs  .
After revision:  Our result also generalizes the known result that for every k\geq 1 and s\geq 0, List k-Colouring is polynomial-time solvable for (sP_1+P_5)-free graphs , which was proven for s=0 by Ho\`ang, Kami\'nski, Lozin, Sawada, and Shu (Algorithmica 2010) and for every s\geq 1 by Couturier, Golovach, Kratsch and Paulusma (Algorithmica 2015) .