#include <bits/stdc++.h>
using namespace std;
void solve();
int main() {
  int m = 1;
  while (m > 0) {
    solve();
    m--;
  }
  return 0;
}
int n, l, m;
vector<vector<int> > g;
vector<vector<int> > town_people;
vector<int> c;
vector<int> tin, tout;
int timer;
vector<vector<int> > up;
vector<vector<vector<int> > > up_sets;
vector<int> _merge(vector<int> a, vector<int> b) {
  int i = 0;
  int j = 0;
  vector<int> ans;
  while ((i < a.size() || j < b.size()) && ans.size() < 10) {
    if (i == a.size()) {
      ans.push_back(b[j]);
      j++;
      continue;
    }
    if (j == b.size()) {
      ans.push_back(a[i]);
      i++;
      continue;
    }
    if (a[i] == b[j]) {
      ans.push_back(a[i]);
      i++;
      j++;
      continue;
    }
    if (a[i] > b[j]) {
      ans.push_back(b[j]);
      j++;
    } else {
      ans.push_back(a[i]);
      i++;
    }
  }
  return ans;
}
void dfs(int v, int p = 0) {
  tin[v] = ++timer;
  up[v][0] = p;
  up_sets[v][0] = town_people[v];
  for (int i = 1; i <= l; ++i) {
    up[v][i] = up[up[v][i - 1]][i - 1];
    up_sets[v][i] = _merge(up_sets[up[v][i - 1]][i - 1], up_sets[v][i - 1]);
  }
  for (size_t i = 0; i < g[v].size(); ++i) {
    int to = g[v][i];
    if (to != p) dfs(to, 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 = l; i >= 0; --i)
    if (!upper(up[a][i], b)) a = up[a][i];
  return up[a][0];
}
vector<int> get_ans(int res, int a) {
  vector<int> ans;
  for (int i = l; i >= 0; --i) {
    if (!upper(up[a][i], res)) {
      ans = _merge(ans, up_sets[a][i]);
      a = up[a][i];
    }
  }
  ans = _merge(ans, up_sets[a][0]);
  return ans;
}
void solve() {
  int q;
  cin >> n >> m >> q;
  g.resize(n);
  for (int i = 0; i < n - 1; i++) {
    int v1, v2;
    cin >> v1 >> v2;
    v1--;
    v2--;
    g[v1].push_back(v2);
    g[v2].push_back(v1);
  }
  c.resize(m);
  town_people.resize(n);
  for (int i = 0; i < m; i++) {
    scanf("%d", &c[i]);
    if (town_people[c[i] - 1].size() < 10)
      town_people[c[i] - 1].push_back(i + 1);
  }
  tin.resize(n), tout.resize(n), up.resize(n), up_sets.resize(n);
  l = 1;
  while ((1 << l) <= n) ++l;
  for (int i = 0; i < n; ++i) {
    up[i].resize(l + 1);
    up_sets[i].resize(l + 1);
  }
  dfs(0);
  for (int i = 0; i < q; i++) {
    int u, v, t;
    scanf("%d%d%d", &u, &v, &t);
    u--;
    v--;
    int res = lca(u, v);
    vector<int> r1 = get_ans(res, u);
    vector<int> r2 = get_ans(res, v);
    vector<int> ans = _merge(r1, r2);
    ans = _merge(ans, town_people[res]);
    if (t >= ans.size()) {
      printf("%d ", ans.size());
      for (int j = 0; j < ans.size(); j++) {
        printf("%d ", ans[j]);
      }
      printf("\n");
    } else {
      printf("%d ", t);
      for (int j = 0; j < t; j++) {
        printf("%d ", ans[j]);
      }
      printf("\n");
    }
  }
}
