Problem: 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>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
inline void rd(int &x) {
  x = 0;
  char o, f = 1;
  while (o = getchar(), o < 48)
    if (o == 45) f = -f;
  do x = (x << 3) + (x << 1) + (o ^ 48);
  while (o = getchar(), o > 47);
  x *= f;
}
void pf(int x) {
  if (x == 0) return;
  pf(x / 10);
  putchar(x % 10 ^ 48);
}
inline void pt(int x) {
  pf(x);
  if (x == 0) putchar('0');
  putchar(' ');
}
int head[100005], to[100005 << 1], nxt[100005 << 1], tot;
inline void add(int a, int b) {
  to[++tot] = b;
  nxt[tot] = head[a];
  head[a] = tot;
}
int n, m, q, a, b, c, tp, ans[100005], st[100005 << 2][12];
int id[100005], reid[100005], dfsid, sz[100005], son[100005], fa[100005],
    top[100005], deep[100005];
vector<int> area[100005];
void dfs(int x, int f) {
  fa[x] = f;
  deep[x] = deep[f] + 1;
  sz[x] = 1;
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (y == fa[x]) continue;
    dfs(y, x);
    sz[x] += sz[y];
    if (sz[y] > sz[son[x]]) son[x] = y;
  }
}
void chain(int x, int f) {
  top[x] = f;
  reid[id[x] = ++dfsid] = x;
  if (son[x]) chain(son[x], f);
  for (int i = head[x]; i; i = nxt[i]) {
    int y = to[i];
    if (y == fa[x] || y == son[x]) continue;
    chain(y, y);
  }
}
void build(int p = 1, int l = 1, int r = n) {
  if (l == r) {
    for (int i = 0; i < area[reid[l]].size() && i < 10; i++)
      st[p][++st[p][0]] = area[reid[l]][i];
    return;
  }
  int mid = l + r >> 1, x = 0, y = 0;
  build(p << 1, l, mid);
  build(p << 1 | 1, mid + 1, r);
  while (st[p][0] < 10 && x < st[p << 1][0] && y < st[p << 1 | 1][0]) {
    if (st[p << 1][x + 1] < st[p << 1 | 1][y + 1])
      st[p][++st[p][0]] = st[p << 1][++x];
    else
      st[p][++st[p][0]] = st[p << 1 | 1][++y];
  }
  while (st[p][0] < 10 && x < st[p << 1][0])
    st[p][++st[p][0]] = st[p << 1][++x];
  while (st[p][0] < 10 && y < st[p << 1 | 1][0])
    st[p][++st[p][0]] = st[p << 1 | 1][++y];
}
void query(int a, int b, int p = 1, int l = 1, int r = n) {
  if (l > b || r < a) return;
  if (l >= a && r <= b) {
    for (int i = 1; i <= min(st[p][0], c); i++) ans[++ans[0]] = st[p][i];
    return;
  }
  int mid = l + r >> 1;
  query(a, b, p << 1, l, mid);
  query(a, b, p << 1 | 1, mid + 1, r);
}
int main() {
  rd(n), rd(m), rd(q);
  for (int i = 1; i < n; i++) rd(a), rd(b), add(a, b), add(b, a);
  dfs(1, 0), chain(1, 1);
  for (int i = 1; i <= m; i++) {
    rd(a);
    area[a].push_back(i);
  }
  for (int i = 1; i <= n; i++) sort(area[i].begin(), area[i].end());
  build();
  while (q--) {
    ans[0] = 0;
    rd(a), rd(b), rd(c);
    while (top[a] != top[b]) {
      if (deep[top[a]] < deep[top[b]]) swap(a, b);
      query(id[top[a]], id[a]);
      a = fa[top[a]];
    }
    if (deep[a] > deep[b]) swap(a, b);
    query(id[a], id[b]);
    sort(ans + 1, ans + 1 + ans[0]);
    pt(min(c, ans[0]));
    for (int i = 1; i <= min(c, ans[0]); i++) pt(ans[i]);
    puts("");
  }
  return 0;
}