#include <bits/stdc++.h>
using namespace std;
vector <int> v[300005];
int lim[300005],val[300005];
set <pair<int,int>> s[300005];
void dfs(int x){
    s[x].insert({val[x],x});
    for(auto t:v[x]) {
        lim[t] = min(lim[t], lim[x]), dfs(t);
        if(s[x].size()<s[t].size()) swap(s[x],s[t]);
        for(auto temp:s[t]) s[x].insert(temp);
    }
    while(s[x].size()>lim[x]) s[x].erase(s[x].begin());
}
int main() {
    int T = 1;
    //cin>>T;
    while(T--){
        int n;
        cin>>n;
        for(int i=1,x;i<n;i++) scanf("%d",&x),v[x].push_back(i+1);
        for(int i=1;i<=n;i++) scanf("%d",&lim[i]);
        for(int i=1;i<=n;i++) scanf("%d",&val[i]);
        dfs(1);
        long long ans=0;
        vector <int> city;
        for(auto t:s[1]) ans+=t.first,city.push_back(t.second);
        sort(city.begin(),city.end());
        printf("%lld\n",ans);
        printf("%d",int(s[1].size()));
        for(auto t:city) printf(" %d",t);
        puts("");
    }
    return 0;
}