We show that the isomorphism test for $n$-vertex edge coloured graphs with the~multiplicity of Jordan blocks bounded by $k$ can be done in time $(e^{k^2}n)^{O(1)}$.