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

#define MAX_NODES 10000

int graph[MAX_NODES][MAX_NODES];
int graphSize[MAX_NODES];

int dfs(int node, int parent, int n) {
    int maxDepth = 0;
    for (int i = 0; i < graphSize[node]; i++) {
        int neighbor = graph[node][i];
        if (neighbor != parent) {
            int depth = 1 + dfs(neighbor, node, n);
            if (depth > maxDepth) {
                maxDepth = depth;
            }
        }
    }
    return maxDepth;
}

int treeDiameter(int** edges, int edgesSize, int* edgesColSize) {
    if (edgesSize == 0) return 0;
    
    int n = edgesSize + 1;
    memset(graphSize, 0, sizeof(graphSize));
    
    for (int i = 0; i < edgesSize; i++) {
        int a = edges[i][0], b = edges[i][1];
        graph[a][graphSize[a]++] = b;
        graph[b][graphSize[b]++] = a;
    }
    
    int maxDiameter = 0;
    for (int start = 0; start < n; start++) {
        int depth = dfs(start, -1, n);
        if (depth > maxDiameter) {
            maxDiameter = depth;
        }
    }
    
    return maxDiameter;
}

int main() {
    // Input parsing and function call
    return 0;
}