题解 | 小红的魔法药剂

void solve() {
    int n;
    cin >> n;
    V<int> a(n + 1, 0);
    FOR(i, 1, n) cin >> a[i];

    int ans = accumulate(ALL(a), 0ll);

    FOR(i, 1, n) {
        int x, y;
        cin >> x >> y;
        int t = ans + a[x] + a[y] - a[i];
        ans = min(ans, t);
    }

    cout << ans;
}