#include <iostream>
#include <vector>

using namespace std;
void dfs(vector<long long> &tevek, vector<long long> &dp, vector<vector<long long>> &adj, int n){
    long long sum=0;
    for(auto x:adj[n])
    {
        dfs(tevek,dp,adj,x);
        sum+=dp[x];
    }
    if(sum>tevek[n])
        dp[n]=sum;
    else
        dp[n]=tevek[n];
}
void count(vector<long long> &tevek, vector<long long> &dp, vector<vector<long long>> &adj, int n,vector<int> &res)
{
    if(dp[n]==tevek[n])
    {
        res.push_back(n);
    }
    else
    {
        for(auto x:adj[n])
            count(tevek,dp,adj,x,res);
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin>>n;
    vector<long long> tevek(n+1);
    vector<long long> dp(n+1,-1);
    for(int i=1; i<=n; i++)
    {
        cin>>tevek[i];
    }
    vector<vector<long long>> adj(n+1);
    for(int i=2; i<=n; i++)
    {
        int x; cin>>x;
        adj[x].push_back(i);
    }
    dfs(tevek,dp,adj,1);
    cout<<dp[1]<<endl;
    vector<int> res;
    count(tevek,dp,adj,1,res);
    cout<<res.size()<<endl;
    for(auto x:res)
        cout<<x<<" ";
    return 0;
}