func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename T, typename U>   std::istream& operator>>(std::istream& i, pair<T, U>& p) {     i >> p.first >> p.second;     return i;   }   template <typename T>   std::istream& operator>>(std::istream& i, vector<T>& t) {     for (auto& v : t) {       i >> v;     }     return i;   }   template <typename T, typename U>   std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {     o << p.first <<     << p.second;     return o;   }   template <typename T>   std::ostream& operator<<(std::ostream& o, const vector<T>& t) {     if (t.empty()) o <<   n ;     for (size_t i = 0; i < t.size(); ++i) {       o << t[i] <<    n [i == t.size() - 1];     }     return o;   }   template <typename T>   using minheap = priority_queue<T, vector<T>, greater<T>>;   template <typename T>   using maxheap = priority_queue<T, vector<T>, less<T>>;   template <typename T>   bool in(T a, T b, T c) {     return a <= b && b < c;   }   unsigned int logceil(long long first) {     return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;   }   namespace std {   template <typename T, typename U>   struct hash<pair<T, U>> {     hash<T> t;     hash<U> u;     size_t operator()(const pair<T, U>& p) const {       return t(p.first) ^ (u(p.second) << 7);     }   };   }  // namespace std   template <typename T, typename F>   T bsh(T l, T h, const F& f) {     T r = -1, m;     while (l <= h) {       m = (l + h) / 2;       if (f(m)) {         l = m + 1;         r = m;       } else {         h = m - 1;       }     }     return r;   }   template <typename F>   double bshd(double l, double h, const F& f, double p = 1e-9) {     unsigned int r = 3 + (unsigned int)log2((h - l) / p);     while (r--) {       double m = (l + h) / 2;       if (f(m)) {         l = m;       } else {         h = m;       }     }     return (l + h) / 2;   }   template <typename T, typename F>   T bsl(T l, T h, const F& f) {     T r = -1, m;     while (l <= h) {       m = (l + h) / 2;       if (f(m)) {         h = m - 1;         r = m;       } else {         l = m + 1;       }     }     return r;   }   template <typename F>   double bsld(double l, double h, const F& f, double p = 1e-9) {     unsigned int r = 3 + (unsigned int)log2((h - l) / p);     while (r--) {       double m = (l + h) / 2;       if (f(m)) {         h = m;       } else {         l = m;       }     }     return (l + h) / 2;   }   template <typename T>   T gcd(T a, T b) {     if (a < b) swap(a, b);     return b ? gcd(b, a % b) : a;   }   template <typename T>   class vector2 : public vector<vector<T>> {    public:     vector2() {}     vector2(size_t a, size_t b, T t = T())         : vector<vector<T>>(a, vector<T>(b, t)) {}   };   template <typename T>   class vector3 : public vector<vector2<T>> {    public:     vector3() {}     vector3(size_t a, size_t b, size_t c, T t = T())         : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}   };   template <typename T>   class vector4 : public vector<vector3<T>> {    public:     vector4() {}     vector4(size_t a, size_t b, size_t c, size_t d, T t = T())         : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}   };   template <typename T>   class vector5 : public vector<vector4<T>> {    public:     vector5() {}     vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())         : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}   };   class DPowerTree {    public:     int N;     vector<vector<int>> E;     vector<long long> C;     vector<int> Omit;     vector<bool> Take;     vector<pair<long long, long long>> Ans;     pair<long long, long long> solve(int u, int p) {       if (E[u].size() == 1 && u != 0) {         return Ans[u] = {0, C[u]};       };       long long a = 0, b = 0;       for (int v : E[u]) {         if (v != p) {           auto s = solve(v, u);           a = min(a + s.second, b + s.first);           b += s.second;         }       }       return Ans[u] = {a, min(b, a + C[u])};     }     void collect(int u, int p, bool allPaths, vector<int>& Ret) {       long long diff = Ans[u].second - Ans[u].first;       if (allPaths && C[u] <= diff) Ret.push_back(u + 1);       int worst = -1;       int cnt = 0;       for (int v : E[u]) {         if (v != p) {           int myDiff = Ans[v].second - Ans[v].first;           if (myDiff > worst) {             worst = myDiff;             cnt = 0;           }           cnt += myDiff == worst;         }       }       for (int v : E[u]) {         if (v != p) {           int myDiff = Ans[v].second - Ans[v].first;           collect(v, u, myDiff < worst || cnt > 1 || (worst <= C[u] && allPaths),                   Ret);         }       }     }     void solve(istream& cin, ostream& cout) {       cin >> N;       C.resize(N);       cin >> C;       E.resize(N);       Ans.resize(N);       for (int i = 0; i < N - 1; ++i) {         int u, v;         cin >> u >> v;         --u;         --v;         E[u].push_back(v);         E[v].push_back(u);       }       auto s = solve(0, -1);       vector<int> X;       collect(0, -1, true, X);       sort(X.begin(), X.end());       cout << s.second <<     << X.size() << endl;       cout << X;     }   };   int main() {     ios_base::sync_with_stdio(false);     cin.tie(nullptr);     cout.tie(nullptr);     DPowerTree solver;     std::istream& in(std::cin);     std::ostream& out(std::cout);     solver.solve(in, out);     return 0;   }   