Fixed sonar

Author: javadev

src/main/java/g3501_3600/s3515_shortest_path_in_a_weighted_tree/Solution.java

@@ -74,7 +74,9 @@ private void dfs(int node, int par, int dist) {
         for (int[] neighborInfo : adj[node]) {
             int neighbor = neighborInfo[0];
             int w = neighborInfo[1];
-            if (neighbor == par) continue;
+            if (neighbor == par) {
+                continue;
+            }
             edgeWeight[neighbor] = w;
             dfs(neighbor, node, dist + w);
         }