#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
const long long inf = 1e18;
int n, m, q, id, cnt = 0, ret[N], at[N], sz[N], son[N], top[N], f[N], in[N],
                 out[N], deep[N], father[N];
vector<int> v[N];
set<pair<long long, int> > s[N];
long long lazy[N << 2];
pair<long long, int> t[N << 2];
void dfs(int x, int fa, int dep) {
  sz[x] = 1;
  son[x] = 0;
  father[x] = fa;
  deep[x] = dep;
  for (auto u : v[x]) {
    if (u == fa) continue;
    dfs(u, x, dep + 1);
    sz[x] += sz[u];
    if (sz[son[x]] < sz[u]) son[x] = u;
  }
}
void dfs2(int x, int tp) {
  top[x] = tp;
  in[x] = f[x] = ++id;
  if (son[x]) dfs2(son[x], tp);
  for (auto u : v[x]) {
    if (u == father[x] || u == son[x]) continue;
    dfs2(u, u);
  }
  out[x] = id;
}
void pushup(int i) { t[i] = min(t[i << 1], t[i << 1 | 1]); }
void pushdown(int i) {
  if (lazy[i]) {
    lazy[i << 1] += lazy[i];
    lazy[i << 1 | 1] += lazy[i];
    t[i << 1].first += lazy[i];
    t[i << 1 | 1].first += lazy[i];
    lazy[i] = 0;
  }
}
void build(int i, int L, int R) {
  lazy[i] = 0;
  if (L == R) {
    t[i] = *s[L].begin();
    return;
  }
  int mid = (L + R) >> 1;
  build(i << 1, L, mid);
  build(i << 1 | 1, mid + 1, R);
  pushup(i);
}
void update(int i, int L, int R, int l, int r, long long val) {
  if (l <= L && R <= r) {
    lazy[i] += val;
    t[i].first += val;
    return;
  }
  pushdown(i);
  int mid = (L + R) >> 1;
  if (l <= mid) update(i << 1, L, mid, l, r, val);
  if (r > mid) update(i << 1 | 1, mid + 1, R, l, r, val);
  pushup(i);
}
void modify(int i, int L, int R, int x) {
  if (L == R) {
    s[L].erase(s[L].begin());
    t[i] = *s[L].begin();
    t[i].first += lazy[i];
    return;
  }
  pushdown(i);
  int mid = (L + R) >> 1;
  if (x <= mid)
    modify(i << 1, L, mid, x);
  else
    modify(i << 1 | 1, mid + 1, R, x);
  pushup(i);
}
pair<long long, int> query(int i, int L, int R, int l, int r) {
  if (l <= L && R <= r) return t[i];
  pushdown(i);
  int mid = (L + R) >> 1;
  if (r <= mid) return query(i << 1, L, mid, l, r);
  if (l > mid) return query(i << 1 | 1, mid + 1, R, l, r);
  return min(query(i << 1, L, mid, l, r), query(i << 1 | 1, mid + 1, R, l, r));
}
int Query(int x, int y) {
  pair<long long, int> ans = pair<long long, int>(inf, 0);
  while (top[x] ^ top[y]) {
    if (deep[top[x]] < deep[top[y]]) swap(x, y);
    ans = min(ans, query(1, 1, n, f[top[x]], f[x]));
    x = father[top[x]];
  }
  if (deep[x] > deep[y]) swap(x, y);
  ans = min(ans, query(1, 1, n, f[x], f[y]));
  return ans.second;
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i(2); i <= (n); ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    v[x].push_back(y);
    v[y].push_back(x);
  }
  dfs(1, 0, 0);
  dfs2(1, 1);
  for (int i(1); i <= (n); ++i) s[i].insert(make_pair(inf, 0));
  at[0] = N - 1;
  for (int i(1); i <= (m); ++i) {
    int x;
    scanf("%d", &x);
    at[i] = x;
    s[f[x]].insert(make_pair(i, i));
  }
  build(1, 1, n);
  while (q--) {
    int op, x, y, lim;
    long long val;
    scanf("%d", &op);
    if (op == 2) {
      scanf("%d%lld", &x, &val);
      update(1, 1, n, in[x], out[x], val);
    } else {
      scanf("%d%d%d", &x, &y, &lim);
      cnt = 0;
      while (lim--) {
        int idx = Query(x, y);
        if (idx == 0) break;
        ret[++cnt] = idx;
        modify(1, 1, n, f[at[idx]]);
      }
      printf("%d", cnt);
      for (int i(1); i <= (cnt); ++i) printf(" %d", ret[i]);
      puts("");
    }
  }
}
