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 MAX = 100100, LG = 18;
int n, head[MAX], to[MAX * 2], nxt[MAX * 2], Ecnt, par[MAX][LG], dpth[MAX];
class Node {
 public:
  int A[11], sz;
  Node() {
    memset(A, 100, sizeof A);
    sz = 0;
  }
  void insert(int v) {
    if (v > MAX || binary_search(A, A + 11, v)) return;
    A[10] = v;
    sort(A, A + 11);
    sz++;
  }
  void print(int c) {
    c = min(c, sz);
    printf("%d", c);
    for (int i = 0; i < c; i++) printf(" %d", A[i]);
    puts("");
  }
} sparse[MAX][LG];
Node merge(Node v, Node u) {
  for (int i = 0; i < 10; i++) v.insert(u.A[i]);
  return v;
}
void addedge(int a, int b) {
  nxt[Ecnt] = head[a];
  head[a] = Ecnt;
  to[Ecnt++] = b;
}
void ini() {
  Ecnt = 0;
  memset(head, -1, (n + 1) * sizeof head[0]);
}
void dfs(int v, int p, int d) {
  dpth[v] = d;
  par[v][0] = p;
  for (int j = 1; j < LG; j++) {
    par[v][j] = par[par[v][j - 1]][j - 1];
    sparse[v][j] = merge(sparse[v][j - 1], sparse[par[v][j - 1]][j - 1]);
  }
  for (int i = head[v]; i != -1; i = nxt[i])
    if (to[i] != p) dfs(to[i], v, d + 1);
}
int lca(int v, int u) {
  if (dpth[v] > dpth[u]) swap(v, u);
  int d = dpth[u] - dpth[v];
  for (int i = 0; i < LG; i++)
    if (d & (1 << i)) {
      u = par[u][i];
      d -= 1 << i;
    }
  for (int i = LG - 1; i >= 0; i--)
    if (par[u][i] != par[v][i]) {
      u = par[u][i];
      v = par[v][i];
    }
  if (u != v) u = par[u][0];
  return u;
}
Node getIDs(int v, int p) {
  Node ret;
  int d = dpth[v] - dpth[p];
  for (int i = 0; i < LG; i++)
    if (d & (1 << i)) {
      ret = merge(ret, sparse[v][i]);
      v = par[v][i];
      d -= 1 << i;
    }
  return merge(ret, sparse[v][d]);
  ;
}
int main() {
  int q, a, b, k, m;
  scanf("%d%d%d", &n, &m, &q);
  ini();
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &a, &b);
    addedge(a, b);
    addedge(b, a);
  }
  for (int i = 1; i <= m; i++) {
    int c;
    scanf("%d", &c);
    sparse[c][0].insert(i);
  }
  dfs(1, 0, 1);
  while (q--) {
    scanf("%d%d%d", &a, &b, &k);
    int l = lca(a, b);
    merge(getIDs(a, l), getIDs(b, l)).print(k);
  }
  return 0;
}
