#include <bits/stdc++.h>
using namespace std;
#define int long long
const int c=1e5+10;
bool vis[c],be[c];
int v[c],dp[c];
vector<int> adj[c];
void dfs(int cs)
{
    vis[cs]=1;
    int ossz=0;
    for(int &i:adj[cs])
        if(!vis[i])
    {
        dfs(i);
        ossz+=dp[i];
    }
    if(ossz<v[cs])
    {
        dp[cs]=v[cs];
        be[cs]=1;
    }
    else dp[cs]=ossz;
}
vector<int> ans;
int sum;
void dfs2(int cs)
{
    vis[cs]=1;
    if(be[cs])
    {
        sum+=v[cs];
        ans.push_back(cs);
        return;
    }
    for(int &i:adj[cs])
        if(!vis[i]) dfs2(i);
}
signed main()
{
    int n; cin>>n;
    for(int i=1; i<=n; i++)
        cin>>v[i];
    for(int i=2; i<=n; i++)
    {
        int x; cin>>x;
        adj[x].push_back(i);
        adj[i].push_back(x);
    }
    dfs(1);
    for(int i=1; i<=n; i++)
        vis[i]=0;
    dfs2(1);
    cout<<sum<<"\n"<<ans.size()<<"\n";
    for(int &i:ans)
        cout<<i<<" ";
    cout<<"\n";
}