#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include "bits/stdc++.h"

#define int long long
#define rep(i, n) for(int (i)=0 ;(i)<n ;(i)++)
using namespace std;
const int N = 3e5 + 69;
int n, p[N], b[N], v[N];
vector<int> g[N];
set<pair<int, int>> city[N];

void dfs(int node) {
    for (auto ch: g[node]) {
        dfs(ch);
        if (city[ch].size() > city[node].size())
            swap(city[ch], city[node]);
        for (auto e: city[ch])
            city[node].insert(e);
        city[ch].clear();
    }
    city[node].insert({v[node], node});
    while (city[node].size() > b[node])
        city[node].erase(city[node].begin());
}

signed main() {
    cin.tie(NULL);
    cout.tie(NULL);
    ios_base::sync_with_stdio(false);
    cin >> n;
    for (int i = 2; i <= n; i++) {
        cin >> p[i];
        g[p[i]].push_back(i);
    }
    for (int i = 1; i <= n; i++)cin >> b[i];
    for (int i = 1; i <= n; i++)cin >> v[i];
    dfs(1);
    int ans = 0;
    for (auto i: city[1])
        ans += i.first;
    cout << ans << '\n' << city[1].size() << ' ';
    vector<int> zby;
    for (auto i: city[1])
        zby.push_back(i.second);
    sort(zby.begin(), zby.end());
    for (auto i: zby)
        cout << i << ' ';
}