ArrayList<ArrayList<Integer>> ans = new ArrayList<>();

    ArrayList<Integer> path = new ArrayList<>();

    public ArrayList<ArrayList<Integer>> FindPath(TreeNode root, int target) {

        dfs(root, 0, target);

        return ans;

    }

    void dfs(TreeNode r, int now, int target) {

        if (r == null) return;

        now += r.val;

        if (now > target) return;

        if (r.left == null && r.right == null && now != target) return;

        path.add(r.val);

        if (r.left == null && r.right == null && now == target)

            ans.add(new ArrayList<>(path));

        else {

            dfs(r.left, now, target);

            dfs(r.right, now, target);

        }

        path.remove(path.size() - 1);

    }