Step 1: The pairs of positions at "distance \(3\)" apart (exactly two people between) are \(\{1,4\},\{2,5\},\{3,6\}\); Q and R occupy one such pair in either order, \(6\) possibilities total.
Step 2: Discard any case with Q in position \(1\), since P must sit somewhere ahead of Q and no position is ahead of the very first spot, this removes \(2\) of the \(6\), leaving \(4\).
Step 3: For each of the \(4\) remaining (Q,R) placements, count how many ways P (ahead of Q), then S (not adjacent to P or R), then T (not first or last), can be placed in the leftover seats, with U filling whatever's left: \(6\) ways for \((Q,R)=(4,1)\), \(1\) way for \((2,5)\), \(5\) ways for \((5,2)\).
Step 4: Add the surviving counts: \[ 6+1+5=\boxed{12} \]