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;
vector<long long> adj[200005], id[200005];
vector<long long> lst[200005][21];
long long sp[200005][21], lvl[200005] = {0};
long long n, m, q;
void dfs(long long r, long long p) {
  sp[r][0] = p ? p : -1;
  sort(id[r].begin(), id[r].end());
  for (long long j = 0; j < min(10ll, (long long)id[r].size()); j++) {
    lst[r][0].push_back(id[r][j]);
  }
  lvl[r] = lvl[p] + 1;
  for (auto i : adj[r]) {
    if (i == p) continue;
    dfs(i, r);
  }
}
void preprocess() {
  for (long long i = 1; i <= 20; i++) {
    for (long long j = 1; j <= n; j++) {
      if (sp[j][i - 1] != -1) {
        sp[j][i] = sp[sp[j][i - 1]][i - 1];
      }
    }
  }
  for (long long j = 1; j <= 20; j++) {
    for (long long i = 1; i <= n; i++) {
      if (sp[i][j - 1] == -1) continue;
      lst[i][j].resize(lst[i][j - 1].size() + lst[sp[i][j - 1]][j - 1].size());
      merge(lst[i][j - 1].begin(), lst[i][j - 1].end(),
            lst[sp[i][j - 1]][j - 1].begin(), lst[sp[i][j - 1]][j - 1].end(),
            lst[i][j].begin());
      lst[i][j].resize(min(10ll, (long long)lst[i][j].size()));
    }
  }
}
long long LCA(long long u, long long v) {
  if (lvl[u] < lvl[v]) swap(u, v);
  for (long long i = 20; i >= 0; i--) {
    if (sp[u][i] != -1 && lvl[sp[u][i]] >= lvl[v]) {
      u = sp[u][i];
    }
  }
  if (u == v) return u;
  for (long long i = 20; i >= 0; i--) {
    if (sp[u][i] != -1 && sp[u][i] != sp[v][i]) {
      u = sp[u][i];
      v = sp[v][i];
    }
  }
  return sp[u][0];
}
void Find(long long x, long long dis, vector<long long> &ans) {
  for (long long i = 20; i >= 0; i--) {
    if (dis >= (1ll << i)) {
      dis -= (1ll << i);
      for (long long i : lst[x][i]) ans.push_back(i);
      x = sp[x][i];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  memset(sp, -1, sizeof sp);
  cin >> n >> m >> q;
  for (long long i = 1; i < n; i++) {
    long long x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  for (long long i = 1; i <= m; i++) {
    long long tem;
    cin >> tem;
    id[tem].push_back(i);
  }
  dfs(1, 0);
  preprocess();
  for (long long i = 1; i <= q; i++) {
    long long x, y, k;
    cin >> x >> y >> k;
    long long lca = LCA(x, y);
    vector<long long> ans;
    Find(x, lvl[x] - lvl[lca] + 1, ans);
    Find(y, lvl[y] - lvl[lca], ans);
    sort(ans.begin(), ans.end());
    ans.resize(min(k, (long long)ans.size()));
    cout << ans.size() << " ";
    for (auto i : ans) {
      cout << i << " ";
    }
    cout << endl;
  }
  return 0;
}