#include <bits/stdc++.h>

#define ll long long
#define ld  double
using namespace std;

// #define int ll

const int N = 3e5 + 5, mod = 998244353;

vector<int> adj[N];

int b[N], val[N];

set<pair<int, int>> *st[N];

void dfs(int node) {
    int bigChild = -1;
    for(auto i: adj[node]) {
        dfs(i);
        if(bigChild == -1 || st[bigChild]->size() < st[i]->size()) {
            bigChild = i;
        }
    }

    if(bigChild == -1) st[node] = new set<pair<int, int> >();
    else {
        st[node] = st[bigChild];
    }
    st[node]->insert({val[node], node});

    for(auto i: adj[node]) {
        if(i == bigChild) continue;
        for(auto x: *st[i]) {
            st[node]->insert(x);
        }
    }

    while((int) st[node]->size() > b[node]) {
        auto it = st[node]->begin();
        st[node]->erase(it);
    }
}


int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n;
    cin >> n;
    for(int i = 2; i <= n; i++) {
        int par;
        cin >> par;
        adj[par].push_back(i);
    }
    for(int i = 1; i <= n; i++) cin >> b[i];
    for(int i = 1; i <= n; i++) cin >> val[i];

    dfs(1);
    ll total = 0;
    vector<int> v;
    for(auto i: *st[1]) {
        total += i.first;
        v.push_back(i.second);
    }

    cout << total << '\n';
    cout << (int) st[1]->size() << ' ';
    sort(v.begin(), v.end());
    for(auto i: v) cout << i << ' ';


    return 0;
}