Partition problem reduction

Suppose I have an algorithm: An undirected graph G = (V, E), each edge has a non-negative weight wi and a non-negative value vi. There are two vertices to represent start point s and end point t. We are also given the upper bound of total weight W and total value V. Decide whether there is a simple path from s to t with the total weight at most W and total value at most V.

How to reduce partition problem to this problem