速救（玄关）

#include <iostream>
using namespace std;
int f[100010];       
int l[100010];   
long long c[100010];
long long s[100010];
int main()
{
    int n;
    cin >> n;
    for (int i = 2; i <= n; ++i) 
    {
        cin >> f[i];
    }
    l[1] = 1; 
    for (int i = 2; i <= n; ++i) 
    {
        l[i] = l[f[i]] + 1;
    }

    for (int i = 1; i <= n; ++i) 
    {
        cin >> c[i];
    }
    for (int i = 1; i <= n; ++i)
    {
        s[l[i]] += c[i];
    }
    long long ans = 1e18;
    for (int i = 1; i <= n; ++i)
    {
        if (s[i] != 0 && s[i] < ans) 
        {
            ans = s[i];
        }
    }
    cout << ans << endl;

    return 0;
}