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;
const int MAXN = 100100, MAXL = 20;
int n, m, q, niv[MAXN], c[MAXN], pai[MAXN], dp[MAXN][MAXL];
vector<int> g[MAXN], ids[MAXN];
bool calc[MAXN][MAXL];
vector<int> memo[MAXN][MAXL];
void dfs(int v, int p = -1) {
  for (auto u : g[v])
    if (u != p) pai[u] = v, niv[u] = niv[v] + 1, dfs(u, v);
}
int ancestral(int v, int x) {
  if (x == 0) return pai[v];
  if (dp[v][x] != -1) return dp[v][x];
  return dp[v][x] = ancestral(ancestral(v, x - 1), x - 1);
}
vector<int> join(vector<int> a, vector<int> b) {
  vector<int> ret;
  int aa = 0, bb = 0;
  while (ret.size() < 10 && (aa < a.size() || bb < b.size())) {
    if (aa == a.size() && bb == b.size()) break;
    if (a.size() == 0 || aa >= a.size())
      ret.push_back(b[bb]), bb++;
    else if (b.size() == 0 || bb >= b.size())
      ret.push_back(a[aa]), aa++;
    else if (a[aa] < b[bb])
      ret.push_back(a[aa]), aa++;
    else
      ret.push_back(b[bb]), bb++;
  }
  return ret;
}
vector<int> f(int v, int x) {
  if (calc[v][x]) return memo[v][x];
  calc[v][x] = 1;
  if (x == 0) return memo[v][x] = ids[v];
  return memo[v][x] = join(f(v, x - 1), f(ancestral(v, x - 1), x - 1));
}
int lca(int a, int b) {
  if (niv[a] < niv[b]) swap(a, b);
  for (int i = MAXL - 1; i >= 0; i--)
    if (niv[a] - (1 << i) >= niv[b]) a = ancestral(a, i);
  if (a == b) return a;
  for (int i = MAXL - 1; i >= 0; i--)
    if (niv[a] - (1 << i) >= 0 && ancestral(a, i) != ancestral(b, i))
      a = ancestral(a, i), b = ancestral(b, i);
  return pai[a];
}
vector<int> resp(int a, int b) {
  int x = lca(a, b);
  vector<int> ret;
  for (int i = MAXL - 1; i >= 0; i--)
    if (niv[a] - (1 << i) >= niv[x])
      ret = join(ret, f(a, i)), a = ancestral(a, i);
  for (int i = MAXL - 1; i >= 0; i--)
    if (niv[b] - (1 << i) >= niv[x])
      ret = join(ret, f(b, i)), b = ancestral(b, i);
  ret = join(ret, ids[x]);
  return ret;
}
int main() {
  memset(dp, -1, sizeof dp);
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1, a, b, c; i < n; i++)
    scanf("%d %d", &a, &b), g[a].emplace_back(b), g[b].emplace_back(a);
  for (int i = 1; i <= m; i++)
    scanf("%d", &c[i]), ids[c[i]] = join(ids[c[i]], {i});
  dfs(1);
  int u, v, a;
  while (q--) {
    scanf("%d %d %d", &u, &v, &a);
    vector<int> ans = resp(u, v);
    if (ans.size() == 0)
      puts("0");
    else {
      int sz = min((int)ans.size(), a);
      printf("%d ", sz);
      for (int i = 0; i < sz; i++) printf("%d ", ans[i]);
      puts("");
    }
  }
}