I have a question. Every path does correspond to a subset in the subset-sum problem, however not every subset necessarily correspond to a path (a path needs to be set of continuous edges). In other words, even though the problem I posted is a special case of subset-sum problem, can it be reduced to subset-sum problem in order to prove NP-completeness. Thanks!