#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = l; i <= r; i++)
using namespace std;
typedef long long ll;
const int N = 300005;
int n;
int b[N], v[N];
int rt[N];
int sz[N];  // of root
vector<int> E[N];
int ans[N], tot;
class node {
   public:
    int val;
    int l, r;
    int len;
    int sz;
    node() {}
    void init(int _val = 0) {
        val = _val;
        l = r = 0;
        len = 1;
        // sz = 1;
    }
    bool operator<(const node &rhs) const { return val < rhs.val; }
} tr[N];
int merge(int x, int y) {
    if (!x || !y) return x | y;
    if (tr[y] < tr[x]) swap(x, y);
    tr[x].r = merge(tr[x].r, y);
    if (tr[tr[x].l].len < tr[tr[x].r].len) {
        swap(tr[x].l, tr[x].r);
        tr[x].len = tr[tr[x].l].len + 1;
    }
    // tr[x].sz = tr[tr[x].l].sz + tr[tr[x].r].sz + 1;
    return x;
}
void pop(int x) {
    sz[x]--;
    rt[x] = merge(tr[rt[x]].l, tr[rt[x]].r);
}
void dfs(int u) {
    for (auto v : E[u]) {
        dfs(v);
        sz[u] += sz[v];
        rt[u] = merge(rt[u], rt[v]);
    }
    while (sz[u] > b[u]) {
        pop(u);
    }
    // while (tr[rt[u]].sz > b[u]) rt[u] = pop(rt[u]);
    // printf("%d: %d(%d)\n", u, rt[u], sz[u]);
}

int main() {
    scanf("%d", &n);
    rep(i, 2, n) {
        int p;
        scanf("%d", &p);
        E[p].push_back(i);
    }
    rep(i, 1, n) { scanf("%d", &b[i]); }
    tr[0].sz = 0;
    rep(i, 1, n) {
        scanf("%d", &v[i]);
        tr[rt[i] = i].init(v[i]);
        sz[i] = 1;
    }
    dfs(1);
    ll sum = 0;
    tot = 0;
    while (sz[1]) {
        sum += tr[rt[1]].val;
        // printf("%d ::%d\n", rt[1], tr[rt[1]].val);
        ans[++tot] = rt[1];
        pop(1);
    }
    printf("%lld\n", sum);
    printf("%d ", tot);
    sort(ans + 1, ans + tot + 1);
    rep(i, 1, tot) printf("%d ", ans[i]);
    return 0;
}