#include <bits/stdc++.h>
using namespace std;
int n, m, q, fa[100005][18], dep[100005];
vector<int> E[100005];
struct hzl {
  int id[15], n;
  hzl() { n = 0; }
  hzl operator+(const hzl &x) {
    hzl ans;
    int l1 = 0, l2 = 0, s = 0;
    while (l1 < n && l2 < x.n && s < 10) {
      if (id[l1] < x.id[l2])
        ans.id[s++] = id[l1++];
      else
        ans.id[s++] = x.id[l2++];
    }
    while (l1 < n && s < 10) ans.id[s++] = id[l1++];
    while (l2 < x.n && s < 10) ans.id[s++] = x.id[l2++];
    ans.n = s;
    return ans;
  }
  void Print(int v) {
    int mi = min(n, v);
    printf("%d", mi);
    for (int i = 0; i < mi; i++) printf(" %d", id[i]);
    puts("");
  }
} A[100005][18];
void dfs(int x, int f) {
  fa[x][0] = f;
  for (int i = 0; i < E[x].size(); i++) {
    int y = E[x][i];
    if (y == f) continue;
    dep[y] = dep[x] + 1;
    dfs(y, x);
  }
}
void UP(int &x, int y, hzl &ans) {
  for (int i = 0; i <= 17; i++)
    if (y & (1 << i)) {
      ans = ans + A[x][i];
      x = fa[x][i];
    }
}
void solve(int a, int b, int v) {
  if (a == b) {
    A[a][0].Print(v);
    return;
  }
  hzl ans;
  if (dep[a] > dep[b]) swap(a, b);
  UP(b, dep[b] - dep[a], ans);
  if (a == b) {
    ans = ans + A[a][0];
    ans.Print(v);
    return;
  }
  for (int i = 17; i >= 0; i--)
    if (fa[a][i] != fa[b][i]) {
      ans = ans + A[a][i] + A[b][i];
      a = fa[a][i];
      b = fa[b][i];
    }
  ans = ans + A[a][1] + A[b][0];
  ans.Print(v);
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    E[a].push_back(b);
    E[b].push_back(a);
  }
  for (int i = 1; i <= m; i++) {
    int a;
    scanf("%d", &a);
    if (A[a][0].n < 10) A[a][0].id[A[a][0].n++] = i;
  }
  dfs(1, 0);
  for (int i = 1; i <= 17; i++) {
    for (int j = 1; j <= n; j++) {
      fa[j][i] = fa[fa[j][i - 1]][i - 1];
      A[j][i] = A[fa[j][i - 1]][i - 1] + A[j][i - 1];
    }
  }
  for (int i = 1; i <= q; i++) {
    int a, b, c;
    scanf("%d%d%d", &a, &b, &c);
    solve(a, b, c);
  }
  return 0;
}
