If we modify Travelling Salesman problem to allow visit to each node more than once, will it still be NP-Complete?

I have little or no knowledge about the NP-Completeness. But I have read that even small variations in problem statements can lead to change in the difficulty.
So if we modify the travelling salesman problem to such that each node needed to visit can be visited more than once, will it still be NP-Complete?

//