#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
vector<vector<int> > g;
vector<int> camel;
vector<bool> chosen;
vector<int> op;

int dfs(int v){
    int r = 0;
    for (int x : g[v]){
        r += dfs(x);
    }
    if (camel[v] > r){
        r = camel[v];
        chosen[v] = true;
    }
    return r;
}

void dfs2(int v){
    if (chosen[v]){
        op.push_back(v);
        return;
    }
    for (int x : g[v]){
        dfs2(x);
    }
}

int main()
{
    int n;
    cin >> n;
    g.resize(n+1);
    camel.resize(n+1);
    chosen.assign(n+1, 0);
    for (int i=1; i<=n; i++){
        cin >> camel[i];
    }
    for (int i=2; i<=n; i++){
        int a;
        cin >> a;
        g[a].push_back(i);
    }
    cout << dfs(1) << "\n";
    dfs2(1);
    cout << op.size() << "\n";
    for (int x : op){
        cout << x << " ";
    }
    return 0;
}