#include <bits/stdc++.h>
#include <cassert>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

mt19937 rnd(time(NULL));
template<typename T>
void shuf(vector<T>& a) {
    for (int i = 1; i < sz(a); i++) swap(a[i], a[rnd() % (i + 1)]);
}

void solve() {
    int n; cin >> n;
    vector<vector<int>> g(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v; cin >> u >> v;
        u--; v--;
        g[u].pb(v);
        g[v].pb(u);
    }

    auto dfs = [&](int v, int p, auto&&self) -> pair<int, int> {
        int sm_subs = 0, sm_dp = 0, siz = 1;
        for (int u : g[v]) {
            if (u != p) {
                auto [subdp, newsiz] = self(u, v, self);
                siz += newsiz;
                sm_dp += subdp + newsiz + 2 * sm_subs * newsiz;
                sm_subs += newsiz;
            }
        }
        return {sm_dp, siz};
    };
    int ans = 1e18;
    for (int i = 0; i < n; i++) ans = min(ans, dfs(i, i, dfs).first);
    cout << ans << '\n';
}

signed main() {
    int tt = 1;
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        cin >> tt;
    #else
        ios::sync_with_stdio(false);
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}