Recently Duff has been a soldier in the army. Malek is her commander.

Their country, Andarz Gu has n cities (numbered from 1 to n) and n - 1 bidirectional roads. Each road connects two different cities. There exist a unique path between any two cities.

There are also m people living in Andarz Gu (numbered from 1 to m). Each person has and ID number. ID number of i - th person is i and he/she lives in city number ci. Note that there may be more than one person in a city, also there may be no people living in the city.

<image>

Malek loves to order. That's why he asks Duff to answer to q queries. In each query, he gives her numbers v, u and a.

To answer a query:

Assume there are x people living in the cities lying on the path from city v to city u. Assume these people's IDs are p1, p2, ..., px in increasing order. 

If k = min(x, a), then Duff should tell Malek numbers k, p1, p2, ..., pk in this order. In the other words, Malek wants to know a minimums on that path (or less, if there are less than a people).

Duff is very busy at the moment, so she asked you to help her and answer the queries.

Input

The first line of input contains three integers, n, m and q (1 ≤ n, m, q ≤ 105).

The next n - 1 lines contain the roads. Each line contains two integers v and u, endpoints of a road (1 ≤ v, u ≤ n, v ≠ u).

Next line contains m integers c1, c2, ..., cm separated by spaces (1 ≤ ci ≤ n for each 1 ≤ i ≤ m).

Next q lines contain the queries. Each of them contains three integers, v, u and a (1 ≤ v, u ≤ n and 1 ≤ a ≤ 10).

Output

For each query, print numbers k, p1, p2, ..., pk separated by spaces in one line.

Examples

Input

5 4 5
1 3
1 2
1 4
4 5
2 1 4 3
4 5 6
1 5 2
5 5 10
2 3 3
5 3 1


Output

1 3
2 2 3
0
3 1 2 4
1 2

Note

Graph of Andarz Gu in the sample case is as follows (ID of people in each city are written next to them):

<image>
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100050;
struct seg {
  int to, v;
} edge[maxn << 1];
int siz[maxn], dep[maxn], son[maxn], fa[maxn], top[maxn], pos[maxn], dfn;
int tot, head[maxn];
priority_queue<int> qu[maxn];
int n, m, q;
struct node {
  int v[10];
  node() { memset(v, 0x3f, sizeof v); }
} tree[maxn << 2];
void addedge(int u, int v) {
  edge[tot].v = v;
  edge[tot].to = head[u];
  head[u] = tot++;
}
void dfs(int x, int d) {
  siz[x] = 1;
  dep[x] = d;
  for (int i = head[x]; ~i; i = edge[i].to) {
    int y = edge[i].v;
    if (y == fa[x]) continue;
    fa[y] = x;
    dfs(y, d + 1);
    siz[x] += siz[y];
    if (son[x] == -1 || siz[y] > siz[son[x]]) son[x] = y;
  }
}
void build(int x, int tp) {
  pos[x] = ++dfn;
  top[x] = tp;
  if (son[x] != -1) build(son[x], tp);
  for (int i = head[x]; ~i; i = edge[i].to) {
    int y = edge[i].v;
    if (y == son[x] || y == fa[x]) continue;
    build(y, y);
  }
}
node operator+(node a, node b) {
  node ans;
  int p1 = 0, p2 = 0;
  for (int i = 0; i < 10; i++) {
    if (a.v[p1] < b.v[p2]) {
      ans.v[i] = a.v[p1];
      p1++;
    } else {
      ans.v[i] = b.v[p2];
      p2++;
    }
  }
  return ans;
}
void push_up(int rt) { tree[rt] = tree[rt << 1] + tree[rt << 1 | 1]; }
void build_tree(int l, int r, int rt) {
  if (l == r) {
    int tt = 0;
    while (!qu[l].empty() && tt < 10) {
      tree[rt].v[tt++] = -qu[l].top();
      qu[l].pop();
    }
    return;
  }
  int mid = (l + r) >> 1;
  build_tree(l, mid, rt << 1);
  build_tree(mid + 1, r, rt << 1 | 1);
  push_up(rt);
}
node query(int L, int R, int l, int r, int rt) {
  if (l >= L && r <= R) {
    return tree[rt];
  }
  int mid = (l + r) >> 1;
  node ans;
  if (mid >= L) ans = ans + query(L, R, l, mid, rt << 1);
  if (mid < R) ans = ans + query(L, R, mid + 1, r, rt << 1 | 1);
  return ans;
}
node find(int x, int y) {
  int f1 = top[x], f2 = top[y];
  node ans;
  while (f1 != f2) {
    if (dep[f1] < dep[f2]) {
      swap(f1, f2);
      swap(x, y);
    }
    ans = ans + query(pos[f1], pos[x], 1, n, 1);
    x = fa[f1];
    f1 = top[x];
  }
  if (dep[x] < dep[y]) swap(x, y);
  ans = ans + query(pos[y], pos[x], 1, n, 1);
  return ans;
}
void init() {
  tot = dfn = 0;
  memset(head, -1, sizeof head);
  memset(son, -1, sizeof head);
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  int x, y, z;
  init();
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &x, &y);
    addedge(y, x);
    addedge(x, y);
  }
  fa[1] = -1;
  dfs(1, 0);
  build(1, 1);
  for (int i = 1; i <= m; i++) {
    scanf("%d", &x);
    qu[pos[x]].push(-i);
  }
  build_tree(1, n, 1);
  for (int i = 1; i <= q; i++) {
    scanf("%d%d%d", &x, &y, &z);
    node ans = find(x, y);
    int tt = 0;
    for (int i = 0; i < 10; i++) {
      if (ans.v[i] != 0x3f3f3f3f) tt++;
    }
    printf("%d", min(tt, z));
    for (int i = 0; i < min(tt, z); i++) {
      printf(" %d", ans.v[i]);
    }
    printf("\n");
  }
  return 0;
}
