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;
vector<long> A[100005];
long B[100005], D[100005];
long pa[100005][100];
vector<long> C[100005], TT[100005][50], TR;
void dfs(long u, long p) {
  D[u] = D[p] + 1;
  pa[u][0] = p;
  TT[u][0] = C[u];
  for (int v : A[u]) {
    if (v == p) continue;
    dfs(v, u);
  }
}
vector<long> loc(vector<long> A1, vector<long> F) {
  vector<long> DA1 = TR;
  int j = 0;
  for (int i : A1) {
    while (j < F.size() && F[j] < i) {
      DA1.push_back(F[j]);
      ++j;
    }
    DA1.push_back(i);
  }
  while (j < F.size()) {
    DA1.push_back(F[j]);
    ++j;
  }
  while (DA1.size() > 10) DA1.pop_back();
  return DA1;
}
void LCA(long u, long v, long c) {
  vector<long> DA1 = TR;
  if (D[u] < D[v]) swap(u, v);
  long kt = D[u] - D[v];
  for (int i = 0; i <= 20; ++i)
    if ((kt >> i) & 1) {
      DA1 = loc(DA1, TT[u][i]);
      u = pa[u][i];
    }
  if (u == v) {
    DA1 = loc(DA1, TT[u][0]);
  } else {
    for (int i = 20; i >= 0; --i) {
      if (pa[u][i] != pa[v][i]) {
        DA1 = loc(DA1, TT[u][i]);
        DA1 = loc(DA1, TT[v][i]);
        u = pa[u][i];
        v = pa[v][i];
      }
    }
    DA1 = loc(DA1, TT[u][0]);
    DA1 = loc(DA1, TT[v][0]);
    DA1 = loc(DA1, TT[pa[u][0]][0]);
  }
  long zz = DA1.size();
  long k = min(c, zz);
  cout << k << " ";
  for (int i = 0; i <= k - 1; ++i) cout << DA1[i] << " ";
  cout << "\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long n, m, q, a, b, c;
  cin >> n >> m >> q;
  for (int i = 1; i <= n - 1; ++i) {
    cin >> a >> b;
    A[a].push_back(b);
    A[b].push_back(a);
  }
  for (int i = 1; i <= m; ++i) {
    cin >> B[i];
    C[B[i]].push_back(i);
  }
  for (int i = 1; i <= n; ++i) {
    sort(C[i].begin(), C[i].end());
    while (C[i].size() > 10) C[i].pop_back();
  }
  dfs(1, 0);
  for (int i = 1; i <= 20; ++i) {
    for (int j = 1; j <= n; ++j) {
      TT[j][i] = loc(TT[j][i - 1], TT[pa[j][i - 1]][i - 1]);
      pa[j][i] = pa[pa[j][i - 1]][i - 1];
    }
  }
  while (q > 0) {
    --q;
    cin >> a >> b >> c;
    LCA(a, b, c);
  }
  return 0;
}
