func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e5 + 5;   vector<int> c[N];   vector<int> s[20][N];   int dp[20][N];   int h[N];   vector<int> v[N];   int sh(int x, int y) {     for (int i = 17; i + 1; --i)       if (y & (1 << i)) x = dp[i][x];     return x;   }   int ac(int x, int y) {     if (h[x] > h[y])       x = sh(x, h[x] - h[y]);     else       y = sh(y, h[y] - h[x]);     for (int i = 17; i + 1 && x != y; --i)       if (dp[i][x] != dp[i][y]) x = dp[i][x], y = dp[i][y];     if (x == y)       return x;     else       return dp[0][x];   }   void dfs(int prec, int node) {     h[node] = h[prec] + 1;     dp[0][node] = prec;     s[0][node] = c[node];     for (auto it : v[node])       if (it != prec) dfs(node, it);   }   vector<int> get(vector<int> a, vector<int> b) {     if (a.empty()) return b;     if (b.empty()) return a;     int *p = new int[a.size() + b.size()];     merge(a.begin(), a.end(), b.begin(), b.end(), p);     vector<int> as;     for (int *r = p, cn = 1; cn <= a.size() + b.size() && cn <= 10; ++r, ++cn)       as.push_back(*r);     while (as.size() && !(*as.begin())) as.erase(as.begin());     return as;   }   int main(void) {     int n, m, q;     scanf( %d%d%d n , &n, &m, &q);     int a, b;     for (int i = 1; i < n; ++i) {       scanf( %d%d , &a, &b);       v[a].push_back(b);       v[b].push_back(a);     }     for (int i = 1; i <= m; ++i) {       scanf( %d , &a);       c[a].push_back(i);     }     for (int i = 1; i <= n; ++i) {       sort(c[i].begin(), c[i].end());       while (c[i].size() > 10) c[i].erase(c[i].end() - 1);     }     dfs(0, 1);     for (int i = 1; i < 18; ++i)       for (int j = 1; j <= n; ++j) {         dp[i][j] = dp[i - 1][dp[i - 1][j]];         s[i][j] = get(s[i - 1][j], s[i - 1][dp[i - 1][j]]);       }     while (q--) {       int a, b, mx;       scanf( %d%d%d , &a, &b, &mx);       int anc = ac(a, b);       int disa = h[a] - h[anc];       int disb = h[b] - h[anc];       vector<int> ans;       for (int i = 17; i + 1; --i)         if ((1 << i) & disa) {           ans = get(ans, s[i][a]);           a = dp[i][a];           while (ans.size() > mx) ans.erase(ans.end() - 1);         }       for (int i = 17; i + 1; --i)         if ((1 << i) & disb) {           ans = get(ans, s[i][b]);           b = dp[i][b];           while (ans.size() > mx) ans.erase(ans.end() - 1);         }       ans = get(ans, c[anc]);       while (ans.size() > mx) ans.erase(ans.end() - 1);       printf( %d  , ans.size());       for (auto it : ans) printf( %d  , it);       printf(  n );     }     return 0;   }   