Algorithm for finding a hamilton cycle in graph with tree width bounded

Show that the Hamiltonian Cycle problems can be solved in time kO(k)n on an n-vertex graph given together with its tree decomposition of width at most k.

I am learning tree width related algorithms, I can’t solve this problem, does anyone have a solution? thank you very much!