Given an $n$ node graph $G = (V, E)$ with edge weights $w: E \rightarrow W$ and a target value $t$, determine whether there is a (not necessarily induced) $3$-matching (i.e. $6$ nodes with $3$ edges forming a matching) whose edge weights sum to $t$.