// g is the adjacency list

// w is the "adjacency list" of weights

void DFS(int node, int cost, int par = -1) {

p[node][0] = par;
maxi[node][0] = cost;

if (par != -1) {
    h[node] = 1 + h[par];
}

for (int i = 1; i < MAX_LOG; i++) {
    if (p[node][i - 1] != -1) {
        p[node][i] = p[p[node][i - 1]][i - 1];
        maxi[node][i] = max(maxi[node][i - 1], maxi[p[node][i - 1]][i - 1]);
    }
}

for (int i = 0; i < (int)g[node].size(); i++) {
    int viz = g[node][i];
    if (viz != par) {
        DFS(viz, w[node][i], node);
    }
}

}