#include <iostream>
#include <vector>
#include <algorithm>
#include <climits>
using namespace std;
vector<int> w;
vector<vector<int>> graph;
vector<vector<long long>> dp;
void solve(int s)
{
if(graph[s].size()==0)
    {
    dp[s][0]=0;
    dp[s][1]=w[s];
    return ;
    }
int sum=0;
dp[s][1]=w[s];
for(auto x : graph[s])
    {
    solve(x);
    dp[s][0]+=max(dp[x][0],dp[x][1]);
    //cout<<x<<" "<<dp[x][0]<<" "<<dp[x][1]<<endl;
    }
}

void backtrac(vector<int> &ans,int s)
{
if(dp[s][1]>=dp[s][0])
    {
    ans.push_back(s);
    return;
    }
for(auto x : graph[s])
    {
    backtrac(ans,x);
    }
}


int main()
{
    int n;
    cin>>n;
    w.resize(n+1);
    for(int i=1;i<=n;i++)cin>>w[i];
    //cout<<w[8]<<endl;
    graph.resize(n+1);
    dp.resize(n+1,vector<long long>(2));
    int x;
    for(int i=2;i<=n;i++)
        {
        cin>>x;
        graph[x].push_back(i);
        }
    solve(1);
    cout<<max(dp[1][0],dp[1][1]);
    vector<int> ans;
    backtrac(ans,1);
    cout<<ans.size()<<endl;
    for(auto x : ans)
    {

    cout<<x<<" ";
    }
    return 0;
}