Step 1: Grouping mandatory pairs.
Q must be next to S, so QS or SQ is a block.
S must also be next to V → the only possible chain is:
\[
Q - S - V
\]
Step 2: Placement of R.
R is immediately to the right of V:
\[
Q - S - V - R
\]
Step 3: Placement of T and U.
T must be to the left of U and must be adjacent:
\[
T - U
\]
Step 4: Remaining car P.
P cannot be next to Q, so P must be placed on the far right end:
\[
Q - S - V - R - T - U - P
\]
This arrangement satisfies all constraints.
Step 5: Checking the options.
(A) "There are two cars between Q and V."
Actual positions: Q(1), S(2), V(3).
There are zero cars between Q and V.
So (A) is incorrect.
(B), (C), (D) are all consistent with the valid arrangement.
Hence, option (A) is the only incorrect statement.