We study the favourite sites of a random walk evolving in a sparse random environment on the set of integers. The walker moves symmetrically apart from some randomly chosen sites where we impose random drift. We prove annealed limit theorems for the time the walk spends in its favourite sites in two cases. The first one, in which it is the distribution of the drift that determines the limiting behaviour of the walk, is a generalization of known results for a random walk in i.i.d. random environment. In the second case a new behaviour appears, caused by the sparsity of the environment.