Find Earliest Fully Connected Time

You are given `n` people labeled `0` to `n - 1` and a list of friendship logs. Each log has the form `(timestamp, personA, personB, action)`, where `action` is either `"friend"` or `"unfriend"`. Friendship is undirected. Process the logs in chronological order. After each event, consider the current friendship graph. Return the earliest timestamp at which all `n` people belong to a single connected component. If that never happens, return `-1`. Notes: - Logs may not be sorted. - If multiple logs have the same timestamp, process them in input order. - Because edges can be both added and removed, the problem requires handling dynamic connectivity rather than only incremental unions.