#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

#define MAX_N 100005

int networkBecomesIdle(int** edges, int edgesSize, int* edgesColSize, int* patience, int patienceSize) {
    int n = patienceSize;
    
    // Build adjacency list
    int graph[MAX_N][MAX_N];
    int graphSize[MAX_N] = {0};
    
    for (int i = 0; i < edgesSize; i++) {
        int u = edges[i][0], v = edges[i][1];
        graph[u][graphSize[u]++] = v;
        graph[v][graphSize[v]++] = u;
    }
    
    // Find shortest distances using BFS
    int distances[MAX_N] = {0};
    bool visited[MAX_N] = {false};
    int queue[MAX_N], front = 0, rear = 0;
    
    queue[rear++] = 0;
    visited[0] = true;
    
    while (front < rear) {
        int node = queue[front++];
        for (int i = 0; i < graphSize[node]; i++) {
            int neighbor = graph[node][i];
            if (!visited[neighbor]) {
                visited[neighbor] = true;
                distances[neighbor] = distances[node] + 1;
                queue[rear++] = neighbor;
            }
        }
    }
    
    int maxTime = 0;
    
    // Calculate for each data server
    for (int i = 1; i < n; i++) {
        int roundTrip = 2 * distances[i];
        
        int lastSendTime;
        if (roundTrip <= patience[i]) {
            lastSendTime = 0;
        } else {
            lastSendTime = ((roundTrip - 1) / patience[i]) * patience[i];
        }
        
        int lastMessageComplete = lastSendTime + roundTrip;
        if (lastMessageComplete > maxTime) {
            maxTime = lastMessageComplete;
        }
    }
    
    return maxTime + 1;
}