  We show that for each natural number $n$ the clique $K_n$ has a weakly
separating path system of size $n+2$, improving the previous best known upper
bound of $(1+o(1))n$. Since $n-1$ is a lower bound, this is almost tight.
