#include <bits/stdc++.h>
using namespace std;
const int maxN = 1e5 + 5;
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
pair<long long, long long> seg[4 * maxN];
int TIME = 0;
int st[maxN], fn[maxN], HD[maxN];
int par[maxN], H[maxN], sz[maxN];
long long lzy[4 * maxN], C[maxN], a[maxN];
vector<int> G[maxN], GR[maxN], c[maxN], vec;
void DFS(int v, int p = 0) {
  H[v] = H[p] + 1;
  sz[v] = 1;
  par[v] = p;
  for (auto u : GR[v]) {
    if (u == p) continue;
    DFS(u, v);
    sz[v] += sz[u];
    G[v].push_back(u);
  }
  for (auto &u : G[v])
    if (sz[u] > sz[G[v][0]]) swap(u, G[v][0]);
  return;
}
void HLD(int v) {
  st[v] = TIME;
  for (auto x : c[v]) a[TIME++] = x;
  for (auto u : G[v]) {
    HD[u] = (u == G[v][0] ? HD[v] : u);
    HLD(u);
  }
  fn[v] = TIME;
  return;
}
pair<long long, long long> merge(pair<long long, long long> A,
                                 pair<long long, long long> B) {
  if (A.first == B.first) return (C[a[A.second]] < C[a[B.second]] ? A : B);
  return min(A, B);
}
void build(int id = 1, int s = 0, int e = TIME) {
  if (e - s <= 1) {
    seg[id] = {a[s], s};
    return;
  }
  int md = (s + e) / 2;
  build(2 * id, s, md);
  build(2 * id + 1, md, e);
  seg[id] = merge(seg[2 * id], seg[2 * id + 1]);
  return;
}
void apply(int id, long long x) {
  seg[id].first += x;
  lzy[id] += x;
  return;
}
void shift(int id) {
  apply(2 * id, lzy[id]);
  apply(2 * id + 1, lzy[id]);
  lzy[id] = 0;
  return;
}
void update(int l, int r, long long x, int id = 1, int s = 0, int e = TIME) {
  if (l <= s && e <= r) {
    return apply(id, x);
  }
  if (l >= e || s >= r) return;
  shift(id);
  int md = (s + e) / 2;
  update(l, r, x, 2 * id, s, md);
  update(l, r, x, 2 * id + 1, md, e);
  seg[id] = merge(seg[2 * id], seg[2 * id + 1]);
  return;
}
void del(int p, int id = 1, int s = 0, int e = TIME) {
  if (e - s <= 1) {
    seg[id] = {INF, -1};
    lzy[id] = 0;
    return;
  }
  shift(id);
  int md = (s + e) / 2;
  if (p < md)
    del(p, 2 * id, s, md);
  else
    del(p, 2 * id + 1, md, e);
  seg[id] = merge(seg[2 * id], seg[2 * id + 1]);
  return;
}
pair<long long, long long> fetch(int l, int r, int id = 1, int s = 0,
                                 int e = TIME) {
  if (l <= s && e <= r) return seg[id];
  if (l >= e || s >= r) return {INF, -1};
  shift(id);
  int md = (s + e) / 2;
  return merge(fetch(l, r, 2 * id, s, md), fetch(l, r, 2 * id + 1, md, e));
}
pair<long long, long long> get(int u, int v) {
  pair<long long, long long> M = {INF, -1};
  while (HD[u] != HD[v]) {
    if (H[HD[u]] > H[HD[v]]) swap(u, v);
    M = merge(M, fetch(st[HD[v]], st[v] + (int)c[v].size()));
    v = par[HD[v]];
  }
  if (H[u] > H[v]) swap(u, v);
  M = merge(M, fetch(st[u], st[v] + (int)c[v].size()));
  return M;
}
int main() {
  time_t START = clock();
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, q;
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    GR[u].push_back(v);
    GR[v].push_back(u);
  }
  for (int i = 1; i <= m; i++) {
    scanf("%lld", C + i);
    c[C[i]].push_back(i);
  }
  H[0] = -1;
  HD[1] = 1;
  a[maxN - 1] = maxN - 1;
  C[maxN - 1] = INF;
  DFS(1);
  HLD(1);
  build();
  while (q--) {
    int t;
    scanf("%d", &t);
    if (t == 1) {
      int u, v, cnt;
      scanf("%d%d%d", &u, &v, &cnt);
      vec.clear();
      while (cnt--) {
        pair<long long, long long> pp = get(u, v);
        if (pp.second == -1) break;
        vec.push_back(a[pp.second]);
        del(pp.second);
      }
      printf("%d ", (int)vec.size());
      for (auto x : vec) printf("%d ", x);
      printf("\n");
    } else {
      int v;
      long long k;
      scanf("%d%lld", &v, &k);
      update(st[v], fn[v], k);
    }
  }
  time_t FINISH = clock();
  cerr << "Execution time: "
       << (long double)(FINISH - START) / CLOCKS_PER_SEC * 1000.0
       << " milliseconds.\n";
  return 0;
}
