Please code in java

Problem Description - 1/1 Given a data generation and storage system, doncribed by an undirected graph with N nodes and Medges Each node will generate a certain amount of data units, given as data for node . For every node 1, the data it generates will be either stored in moderne, or any of the nodes, connected with node i by an edge. The b lom makes the decisions on where to store the generated data automatically. Since the system is new, the decisions it makes are not always perlea, and your wondering what is the maximum possible total amount of data that will need to be stored in a single node in the worst case? Function Description Complete the maxData function in the editor below. It has the following parameter(s): Name Type Description data INTEGER ARRAY amounts of data generated in each node Parameters edges INTEGER 2D ARRAY for every row, two nodes connected by the corresponding edge Return The function must return an INTEGER denoting the the maximum possible amount of data that will need to be stored in a single node in the worst case. Constraints 1sns 10^5 15m 1045 1