of length n where vals[i] denotes the value of the ith node.

You are also given a 2D integer array edges where edges[i] = [ai, bi] denotes that there exists an undirected edge connecting nodes ai and bi.

A star graph is a subgraph of the given graph having a center node containing 0 or `more neighbors. In other words, it is a subset of edges of the given graph such that there exists a common node for all edges.

The image below shows star graphs with 3 and 4 neighbors respectively, centered at the blue node.

graph TD;
	subgraph S1[" "]
		A(" ") --- B(" ") & C(" ") & D(" ")
	end

	subgraph S2[" "]
		E(" ") --- F(" ") --- G(" ")
		H(" ") --- F
		F --- I(" ")
	end

classDef blue fill:#87CEEB,stroke:#333,stroke-width:2px;

class A blue
class F blue

The star sum is the sum of the values of all the nodes present in the star graph.

Given an integer k, return the maximum star sum of a star graph containing at most

Related Tags