#include <iostream>
#include <vector>
#include <queue>

using namespace std;

void DFS(vector<vector<int>> &adj, int node, long long termeles[], long long dp[])
{
    long long sum = 0;
    for(int i = 0; i < adj[node].size(); i++){
        DFS(adj, adj[node][i], termeles, dp);
        sum += dp[adj[node][i]];
    }
    dp[node] = max(termeles[node], sum);
}

long long BFS(vector<vector<int>> &adj, long long termeles[], long long dp[], vector<int> &megoldas)
{
    long long osszeg = 0;
    queue<int> q;
    q.push(1);
    while(!q.empty()){
        int currNode = q.front();
        q.pop();
        if(dp[currNode] == termeles[currNode]){
            osszeg += dp[currNode];
            megoldas.push_back(currNode);
            continue;
        }
        for(int i = 0; i < adj[currNode].size(); i++){
            int newNode = adj[currNode][i];
            q.push(newNode);
        }
    }
    return osszeg;
}

int main()
{
    int N;
    cin >> N;
    vector<vector<int>> adj(N+1);
    long long termeles[100001];
    for(int i = 1; i <= N; i++){
        cin >> termeles[i];
    }
    for(int i = 2; i <= N; i++){
        int a;
        cin >> a;
        adj[a].push_back(i);
    }

    long long dp[100001] = {};
    DFS(adj, 1, termeles, dp);
    vector<int> megoldas;
    cout << BFS(adj, termeles, dp, megoldas) << endl;
    cout << megoldas.size() << endl;
    for(int i = 0; i < megoldas.size(); i++){
        cout << megoldas[i] << " ";
    }
    return 0;
}