Some unavoidable subdigraphs of tournaments

Let H(n, i) be a simple (n ? 1)-path v₁ → v₂ → …? → v_n with an additional arc v₁v_i (3 ? i ? n). We prove that for each n and i (3 ? i ? n), with few exceptions, every n-tournament T_n contains a copy of H(n, i).