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

#define ll long long

vector<vector <ll>> graf;
vector <ll> sulyok;
set <ll> ans;

ll dfs(int p){
    ll sum = 0;
    for(int x : graf[p]){
        sum += dfs(x);
    }
    if(sulyok[p] >= sum){
        ans.insert(p);
        for(int x : graf[p]){
            ans.erase(x);
        }
    }
    return max(sum,sulyok[p]);
}

int main() {
	int n,a; cin >> n;
    graf.resize(n+1);
    sulyok.resize(n+1);
    for(int i = 1; i <= n; i++) cin >> sulyok[i];
    for(int i = 2; i <= n; i++){
        cin >> a;
        graf[a].push_back(i);
    }
    cout << dfs(1) << '\n';
    cout << ans.size() << '\n';
    for(ll x : ans)    cout << x << ' ';
}