Problem: Barney is searching for his dream girl. He lives in NYC. NYC has n junctions numbered from 1 to n and n - 1 roads connecting them. We will consider the NYC as a rooted tree with root being junction 1. m girls live in NYC, i-th of them lives along junction ci and her weight initially equals i pounds.

<image>

Barney consider a girl x to be better than a girl y if and only if: girl x has weight strictly less than girl y or girl x and girl y have equal weights and index of girl x living junction index is strictly less than girl y living junction index, i.e. cx < cy. Thus for any two girls one of them is always better than another one.

For the next q days, one event happens each day. There are two types of events:

  1. Barney goes from junction v to junction u. As a result he picks at most k best girls he still have not invited from junctions on his way and invites them to his house to test if one of them is his dream girl. If there are less than k not invited girls on his path, he invites all of them.
  2. Girls living along junctions in subtree of junction v (including v itself) put on some weight. As result, their weights increase by k pounds. 



Your task is for each event of first type tell Barney the indices of girls he will invite to his home in this event.

Input

The first line of input contains three integers n, m and q (1 ≤ n, m, q ≤ 105) — the number of junctions in NYC, the number of girls living in NYC and the number of events respectively.

The next n - 1 lines describes the roads. Each line contains two integers v and u (1 ≤ v, u ≤ n, v ≠ u) meaning that there is a road connecting junctions v and u .

The next line contains m integers c1, c2, ..., cm (1 ≤ ci ≤ n) — the girl's living junctions.

The next q lines describe the events in chronological order. Each line starts with an integer t (1 ≤ t ≤ 2) — type of the event .

If t = 1 then the line describes event of first type three integers v, u and k (1 ≤ v, u, k ≤ n) follow — the endpoints of Barney's path and the number of girls that he will invite at most.

Otherwise the line describes event of second type and two integers v and k (1 ≤ v ≤ n, 1 ≤ k ≤ 109) follow — the root of the subtree and value by which all the girls' weights in the subtree should increase.

Output

For each event of the first type, print number t and then t integers g1, g2, ..., gt in one line, meaning that in this event Barney will invite t girls whose indices are g1, ..., gt in the order from the best to the worst according to Barney's considerations.

Example

Input

5 7 11
3 5
2 3
4 3
1 4
4 1 4 5 4 1 4
2 4 3
1 2 1 2
1 4 2 1
2 2 10
2 1 10
1 2 4 1
1 2 3 4
2 5 2
2 4 9
1 3 5 2
1 1 2 3


Output

2 2 1 
1 3 
1 5 
0 
1 4 
2 6 7 

Note

For the first sample case:

<image>

Description of events:

  1. Weights of girls in subtree of junction 4 increase by 3. These girls have IDs: 1, 3, 5, 4, 7. 
  2. Barney goes from junction 2 to 1. Girls on his way have IDs 1, 2, 3, 5, 6, 7 with weights 4, 2, 6, 8, 6, 10 respectively. So, he invites girls 2 and 1. 
  3. Barney goes from junction 4 to junction 2. Girls on his way has IDs 3, 5, 7 with weights 6, 8, 10 respectively. So he invites girl 3. 
  4. Weight of girls in subtree of junction 2 increase by 10. There are no not invited girls, so nothing happens. 
  5. Weight of girls in subtree of junction 1 increase by 10. These girls (all girls left) have IDs: 4, 5, 6, 7. 
  6. Barney goes from junction 2 to junction 4. Girls on his way has IDs 5, 7 with weights 18, 20 respectively. So he invites girl 5. 
  7. Barney goes from junction 2 to junction 3. There is no girl on his way. 
  8. Weight of girls in subtree of junction 5 increase by 2. The only girl there is girl with ID 4. 
  9. Weight of girls in subtree of junction 4 increase by 9. These girls have IDs: 4, 6, 7. 
  10. Barney goes from junction 3 to junction 5. Only girl on his way is girl with ID 4. 
  11. Barney goes from junction 1 to junction 2. Girls on his way has IDs 6, 7 with weights 16, 29 respectively. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 1;
const long long inf = 1e17;
int n, m, q;
int numChain[N], curChain = 1, top = 0, par[N];
int pos[N], Moe_algorithm___Too_moe_not_to_read[N], ar[N], heavyChild[N],
    size[N], head[N];
long long lazy[4 * N];
vector<int> G[N];
pair<long long, int> IT[4 * N];
list<pair<long long, int> > GLive[N];
void DFS(int u, int v) {
  size[u] = 1;
  par[u] = v;
  for (int p : G[u]) {
    if (p == v) continue;
    DFS(p, u);
    if (size[p] > size[heavyChild[u]]) heavyChild[u] = p;
    size[u] += size[p];
  }
}
void hld(int u) {
  numChain[u] = curChain;
  pos[u] = Moe_algorithm___Too_moe_not_to_read[u] = ++top;
  ar[top] = u;
  if (not head[curChain]) head[curChain] = u;
  if (heavyChild[u])
    hld(heavyChild[u]), Moe_algorithm___Too_moe_not_to_read[u] =
                            Moe_algorithm___Too_moe_not_to_read[heavyChild[u]];
  for (int p : G[u]) {
    if (par[p] == u && p != heavyChild[u]) {
      curChain++;
      hld(p);
      Moe_algorithm___Too_moe_not_to_read[u] =
          Moe_algorithm___Too_moe_not_to_read[p];
    }
  }
}
void build(int id, int l, int r) {
  if (l == r) {
    IT[id] = {GLive[ar[l]].begin()->first, ar[l]};
    return;
  }
  int mid = (l + r) >> 1;
  build(id << 1, l, mid);
  build((id << 1) | 1, mid + 1, r);
  IT[id] = min(IT[id << 1], IT[(id << 1) | 1]);
}
void down(int id, int l, int mid, int r) {
  lazy[id << 1] += lazy[id];
  lazy[(id << 1) | 1] += lazy[id];
  IT[(id << 1)].first += lazy[id];
  IT[(id << 1) | 1].first += lazy[id];
  lazy[id] = 0;
}
void upd(int id, int l, int r, int L, int R, long long val) {
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    lazy[id] += val;
    IT[id].first += val;
    return;
  }
  int mid = (l + r) >> 1;
  if (lazy[id] != 0) down(id, l, mid, r);
  upd(id << 1, l, mid, L, R, val);
  upd((id << 1) | 1, mid + 1, r, L, R, val);
  IT[id] = min(IT[id << 1], IT[(id << 1) | 1]);
}
pair<long long, int> GET(int id, int l, int r, int L, int R) {
  if (l > R || r < L) return {inf, 0};
  if (l >= L && r <= R) return IT[id];
  int mid = (l + r) >> 1;
  if (lazy[id] != 0) down(id, l, mid, r);
  return min(GET(id << 1, l, mid, L, R), GET((id << 1) | 1, mid + 1, r, L, R));
}
pair<long long, int> PATH(int u, int v) {
  pair<long long, int> ans = {inf, 0};
  while (numChain[u] != numChain[v]) {
    if (numChain[u] < numChain[v]) swap(u, v);
    ans = min(ans, GET(1, 1, n, pos[head[numChain[u]]], pos[u]));
    u = par[head[numChain[u]]];
  }
  return min(ans, GET(1, 1, n, min(pos[u], pos[v]), max(pos[u], pos[v])));
}
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    G[u].push_back(v);
    G[v].push_back(u);
  }
  DFS(1, 0);
  hld(1);
  for (int i = 1; i <= 4 * n; i++) IT[i] = {inf, inf};
  for (int i = 1; i <= m; i++) {
    int u;
    scanf("%d", &u);
    GLive[u].push_back({i, i});
  }
  for (int i = 1; i <= n; i++) GLive[i].push_back({inf, 0});
  build(1, 1, n);
  while (q--) {
    int type, u;
    scanf("%d %d", &type, &u);
    if (type == 1) {
      int v, k;
      scanf("%d %d", &v, &k);
      vector<int> ans;
      for (int i = 0; i < k; i++) {
        pair<long long, int> tmp = PATH(u, v);
        if (tmp.first < inf) {
          int node = tmp.second;
          ans.push_back(GLive[node].begin()->second);
          upd(1, 1, n, pos[node], pos[node], -(GLive[node].begin()->first));
          GLive[node].pop_front();
          upd(1, 1, n, pos[node], pos[node], GLive[node].begin()->first);
        } else
          break;
      }
      printf("%d ", ans.size());
      for (int i : ans) printf("%d ", i);
      printf("\n");
    } else {
      long long val;
      scanf("%lld", &val);
      upd(1, 1, n, pos[u], Moe_algorithm___Too_moe_not_to_read[u], val);
    }
  }
}