#include <bits/stdc++.h>
using namespace std;

vector <vector <long long> > g;
vector <long long> W;
vector <bool> Q;
vector <long long> ans;


long long dfs(long long node){
    long long maxi = 0;
    for(auto x : g[node])
        maxi += dfs(x);
    if(maxi > W[node])
        return maxi;
    Q[node] = 1;
    return W[node];
}

void dfs2(long long node){
    if(Q[node]){
        ans.push_back(node);
        return;
    }
    for(auto x : g[node])
        dfs2(x);
}

int main(){
    long long N;
    cin >> N;
    W.resize(N + 1);
    g.resize(N + 1);
    Q.resize(N + 1);
    for(long long i = 1; i <= N; i++)
        cin >> W[i];
    for(long long i = 2; i <= N; i++){
        long long x;
        cin >> x;
        g[x].push_back(i);
    }
    cout << dfs(1) << '\n';
    dfs2(1);
    cout << ans.size() << '\n';
    for(auto x : ans){
        cout << x << ' ';
    }
}