#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e15;
const int N = 2e5 + 10;
int I[N], st[N], fn[N], par[N], h[N], sz[N], big[N], hd[N], n, m, q, timer;
long long w[N];
vector<int> g[N], V[N];
struct Node {
  pair<long long, long long> Mn;
  long long Lazy = 0;
} seg[N << 2];
void apply(int id, long long val) {
  seg[id].Mn.first += val;
  seg[id].Lazy += val;
}
void shift(int id) {
  if (seg[id].Lazy == 0) return;
  apply(id << 1, seg[id].Lazy);
  apply(id << 1 | 1, seg[id].Lazy);
  seg[id].Lazy = 0;
}
void add(int l, int r, long long val, int L = 0, int R = n + m, int id = 1) {
  if (r <= L || R <= l) return;
  if (l <= L && R <= r) {
    apply(id, val);
    return;
  }
  shift(id);
  add(l, r, val, L, (L + R) >> 1, id << 1);
  add(l, r, val, (L + R) >> 1, R, id << 1 | 1);
  seg[id].Mn = min(seg[id << 1].Mn, seg[id << 1 | 1].Mn);
}
pair<long long, long long> get(int l, int r, int L = 0, int R = n + m,
                               int id = 1) {
  if (r <= L || R <= l) return {inf, inf};
  if (l <= L && R <= r) return seg[id].Mn;
  shift(id);
  return min(get(l, r, L, (L + R) >> 1, id << 1),
             get(l, r, (L + R) >> 1, R, id << 1 | 1));
}
void Build(int L = 0, int R = n + m, int id = 1) {
  if (R - L == 1) {
    seg[id].Mn = {w[I[L]], I[L]};
    return;
  }
  Build(L, (L + R) >> 1, id << 1);
  Build((L + R) >> 1, R, id << 1 | 1);
  seg[id].Mn = min(seg[id << 1].Mn, seg[id << 1 | 1].Mn);
  return;
}
int dfs_size(int v) {
  for (int u : g[v])
    if (u != par[v]) {
      par[u] = v, h[u] = h[v] + 1;
      sz[v] += dfs_size(u);
      if (sz[u] > sz[big[v]]) big[v] = u;
    }
  return ++sz[v];
}
void dfs_hld(int v) {
  for (int i : V[v]) I[timer] = i, st[i] = timer++;
  if (big[v]) hd[big[v]] = hd[v], dfs_hld(big[v]);
  for (int u : g[v])
    if (u != par[v] & u != big[v]) hd[u] = u, dfs_hld(u);
  for (int i : V[v]) fn[i] = timer;
}
pair<long long, long long> getmin(int u, int v) {
  pair<long long, long long> res = {inf, inf};
  while (hd[u] != hd[v]) {
    if (h[hd[v]] > h[hd[u]]) swap(u, v);
    res = min(res, get(st[hd[u]], st[u] + (int)V[u].size()));
    u = par[hd[u]];
  }
  if (h[v] < h[u]) swap(u, v);
  res = min(res, get(st[u], st[v] + (int)V[v].size()));
  return res;
}
void query(int u, int v, int k) {
  vector<int> ans;
  while (k--) {
    pair<long long, long long> p = getmin(u, v);
    if (p.first >= inf) break;
    ans.push_back(p.second);
    add(st[p.second], st[p.second] + 1, inf);
  }
  cout << ans.size() << " ";
  for (int i : ans) cout << i - n << " ";
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> q;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  for (int i = 1; i <= n + m; i++) {
    if (i <= n) {
      V[i].push_back(i), w[i] = inf;
      continue;
    }
    int c;
    cin >> c;
    V[c].push_back(i), w[i] = i - n;
  }
  dfs_size(1), hd[1] = 1, dfs_hld(1), Build();
  while (q--) {
    int t;
    cin >> t;
    if (t == 1) {
      int u, v, k;
      cin >> u >> v >> k;
      query(u, v, k);
    }
    if (t == 2) {
      int v, k;
      cin >> v >> k;
      add(st[v], fn[v], k);
    }
  }
  return 0;
}
