Maximum Score of a Node Sequence

Given an undirected graph with node scores, find the maximum sum of scores of any simple path of exactly four nodes (a–b–c–d with edges between adjacent nodes), or return -1 if no such path exists. Large constraints (n, m up to ~5·10^4) mean brute-force enumeration is too slow and you must prune/limit neighbor choices to compute the optimum efficiently.