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

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl
#define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;}


typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(int i=0;i<(n);i++)
#define rep1(i,n) for(int i=1;i<=(n);i++)
#define rrep(i,n) for(int i=(n)-1;i>=0;i--)
#define rrep1(i,n) for(int i=(n);i>0;i--)
#define REP(i,a,b) for(int i=a;i<b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const ll MOD = 1000000007;
//const ll MOD = 998244353;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { -1,0, 1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);
// #define mp make_pair
//#define endl '\n'

vi dist;

void dfs (vector<vector<pii>> &G, int now, int par, int d) {
  rep (i, G[now].size()) {
    if (G[now][i].first == par) continue;
    int ch = G[now][i].first;
    dist[ch] = d + G[now][i].second;
    dfs(G, ch, now, dist[ch]);
  }
}

void solve(int n, vi p, vi d) {
  dist.clear();
  dist.resize(n);
  fill(all(dist), -inf);
  vector<vector<pii> > G(n);
  rep (i, n - 1) {
    G[i + 1].push_back(pii(p[i], d[i]));
    G[p[i]].push_back(pii(i + 1, d[i]));
  }

  if (n == 2) {
    cout << d[0] << endl;
    return;
  }

  int ans = 0;
  int root;
  set<int> leaf;
  rep (i, n) {
    if (G[i].size() == 1) {
      leaf.insert(i);
      ans += G[i][0].second;
    }
    else {
      root = i;
    }
  }


  vector<vector<pii> > G2(n);
  rep (i, n) {
    if (leaf.count(i)) continue;
    rep (j, G[i].size()) {
      int v = G[i][j].first;
      if (leaf.count(v)) continue;
      G2[i].push_back(pii(v, G[i][j].second));
    }
  }

  dfs(G2, root, -1, 0);
  int ma = 0;
  rep (i, dist.size()) {
    if (dist[i] > ma) {
      ma = dist[i];
      root = i;
    }
  }

  dist[root] = 0;
  dfs(G2, root, -1, 0);
  ma = 0;
  rep (i, dist.size()) {
    if (dist[i] > ma) {
      ma = dist[i];
      root = i;
    }
  }

  rep (i, n) {
    rep (j, G2[i].size()) {
      if (G2[i][j].first > i) {
        ans += G2[i][j].second * 3;
      }
    }
  }

  ans -= ma;
  cout << ans << endl;
  
}

int main() {
  while (true) {
    int n;
    cin >> n;
    if (n == 0) return 0;
    vi p(n - 1), d(n - 1);
    rep (i, n - 1) {
      cin >> p[i];
      p[i]--;
    }
    rep (i, n - 1) {
      cin >> d[i];
    }
    solve(n, p, d);
  }
}



Measured memory_bytes: 3308