func_code_string: #include <bits/stdc++.h>   using namespace std;   mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());   const double eps = 0.00001;   const int MOD = 1000000007;   const int INF = 1000055555;   const long long LLINF = 1223372000000000555;   const int N = 1e5 + 1e4;   const int M = 1234;   const int MAGIC = 10;   vector<int> merge(vector<int> a, vector<int> b) {     vector<int> v;     int i = 0, j = 0;     while (i < a.size() || j < b.size()) {       if (v.size() == MAGIC) break;       if (i == a.size())         v.push_back(b[j++]);       else if (j == b.size())         v.push_back(a[i++]);       else if (a[i] < b[j])         v.push_back(a[i++]);       else         v.push_back(b[j++]);       if (v.size() > 1 && v[v.size() - 2] == v.back()) v.pop_back();     }     return v;   }   vector<int> g[N];   vector<int> arr[N][20];   int tin[N], tout[N], timer = 0;   int up[N][20];   void dfs(int v, int p) {     tin[v] = ++timer;     up[v][0] = p;     for (int i = 1; i < 20; i++) {       up[v][i] = up[up[v][i - 1]][i - 1];       int UP = up[v][i - 1];       arr[v][i] = merge(arr[v][i - 1], arr[UP][i - 1]);     }     for (int u : g[v]) {       if (u != p) dfs(u, v);     }     tout[v] = ++timer;   }   bool upper(int a, int b) { return (tin[a] <= tin[b] && tout[a] >= tout[b]); }   int LCA(int a, int b) {     if (upper(a, b)) return a;     if (upper(b, a)) return b;     for (int i = 19; i >= 0; i--) {       if (!upper(up[a][i], b)) a = up[a][i];     }     return up[a][0];   }   void out(vector<int> &v, int a) {     int k = min(a, ((int)v.size()));     cout << k <<    ;     for (int i = 0; i < k; i++) {       cout << v[i] <<    ;     }     cout << endl;   }   void solve() {     int n, m, q;     cin >> n >> m >> q;     for (int i = 1; i < n; i++) {       int u, v;       cin >> u >> v;       g[u].push_back(v);       g[v].push_back(u);     }     for (int i = 1; i <= m; i++) {       int x;       cin >> x;       arr[x][0].push_back(i);     }     for (int i = 1; i <= n; i++) {       if (arr[i][0].size() > MAGIC) arr[i][0].resize(MAGIC);     }     dfs(1, 1);     while (q--) {       int u, v, a;       cin >> u >> v >> a;       if (v == u) {         out(arr[v][0], a);         continue;       }       int lca = LCA(u, v);       if (u == lca) {         vector<int> vv;         for (int i = 19; i >= 0; i--) {           if (!upper(up[v][i], lca) && up[v][i]) {             vv = merge(vv, arr[v][i]);             v = up[v][i];           }         }         vv = merge(vv, arr[u][0]);         vv = merge(vv, arr[v][0]);         out(vv, a);         continue;       }       if (v == lca) {         vector<int> vv;         for (int i = 19; i >= 0; i--) {           if (!upper(up[u][i], lca)) {             vv = merge(vv, arr[u][i]);             u = up[u][i];           }         }         vv = merge(vv, arr[u][0]);         vv = merge(vv, arr[v][0]);         out(vv, a);         continue;       }       vector<int> vv = arr[lca][0];       for (int i = 19; i >= 0; i--) {         if (!upper(up[v][i], lca)) {           vv = merge(vv, arr[v][i]);           v = up[v][i];         }       }       for (int i = 19; i >= 0; i--) {         if (!upper(up[u][i], lca)) {           vv = merge(vv, arr[u][i]);           u = up[u][i];         }       }       vv = merge(vv, arr[u][0]);       vv = merge(vv, arr[v][0]);       out(vv, a);     }   }   int main() {     ios_base::sync_with_stdio(false);     int T = 1;     while (T--) {       solve();     }     return 0;   }   