#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T Gcd(T a, T b) {
  if (a < 0) return Gcd(-a, b);
  if (b < 0) return Gcd(a, -b);
  return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
  if (a < 0) return Lcm(-a, b);
  if (b < 0) return Lcm(a, -b);
  return a * (b / Gcd(a, b));
}
long long Bigmod(long long base, long long power, long long MOD) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
long long ModInverse(long long number, long long MOD) {
  return Bigmod(number, MOD - 2, MOD);
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
vector<long long int> A[400007];
vector<long long int> B[400007];
int Tot[400007], ChainNo, Pos[400007], now, Ed[400007];
int St[400007], IdNo[400007], Par[400007], Lev[400007];
int Node[400007];
void Dfs(int u, int p, int L) {
  Par[u] = p;
  Tot[u] = 1;
  Lev[u] = L;
  for (int i = 0; i < A[u].size(); i++) {
    int v = A[u][i];
    if (v == p) continue;
    Dfs(v, u, L + 1);
    Tot[u] += Tot[v];
  }
  return;
}
void Hld(int u, int p) {
  if (St[ChainNo] == -1) {
    St[ChainNo] = u;
  }
  Pos[u] = ++now;
  Node[now] = u;
  IdNo[u] = ChainNo;
  int Special, mx = -1;
  for (int i = 0; i < A[u].size(); i++) {
    int v = A[u][i];
    if (v == p) continue;
    if (mx < Tot[v]) {
      mx = Tot[v];
      Special = v;
    }
  }
  if (mx != -1) Hld(Special, u);
  for (int i = 0; i < A[u].size(); i++) {
    int v = A[u][i];
    if (v == p || v == Special) continue;
    ChainNo++;
    Hld(v, u);
  }
  Ed[u] = now;
}
int Lca(int u, int v) {
  while (true) {
    int unom = IdNo[u], vnom = IdNo[v];
    int ustart = St[unom], vstart = St[vnom];
    if (unom == vnom)
      return (Lev[u] < Lev[v] ? u : v);
    else if (Lev[ustart] < Lev[vstart])
      v = Par[vstart];
    else
      u = Par[ustart];
  }
}
vector<long long int> Save[400007 * 4];
pair<long long int, long long int> Tree[400007 * 4];
long long int Lazy[400007 * 4];
int N;
pair<long long int, long long int> Chk(pair<long long int, long long int> a,
                                       pair<long long int, long long int> b) {
  if (a.first < b.first)
    return a;
  else if (a.first == b.first) {
    if (a.second < b.second)
      return a;
    else
      return b;
  } else
    return b;
}
int W[400007 * 4];
int Wd[400007 * 4];
void Build(int id, int l, int r) {
  if (l == r) {
    int u = Node[l];
    W[u] = l;
    Wd[u] = id;
    for (int i = 0; i < B[u].size(); i++) Save[id].push_back(B[u][i]);
    int lst = Save[id].size() - 1;
    Tree[id] = make_pair(Save[id][lst], u);
    return;
  }
  int mid = (l + r) / 2;
  int lft = 2 * id;
  int rgt = lft + 1;
  Build(lft, l, mid);
  Build(rgt, mid + 1, r);
  Tree[id] = Chk(Tree[lft], Tree[rgt]);
  return;
}
void PointUpdate(int id, int l, int r, int pos) {
  if (l == r) {
    int u = Node[l];
    int lst = Save[id].size() - 1;
    if (lst != 0) {
      lst--;
      Save[id].pop_back();
    }
    Tree[id] = make_pair(Save[id][lst], u);
    if (lst != 0) Tree[id].first += Lazy[id];
    return;
  }
  int mid = (l + r) / 2;
  int lft = 2 * id;
  int rgt = lft + 1;
  if (pos <= mid)
    PointUpdate(lft, l, mid, pos);
  else
    PointUpdate(rgt, mid + 1, r, pos);
  Tree[id] = Chk(Tree[lft], Tree[rgt]);
  if (Tree[id].first < 1000000000000000000LL) Tree[id].first += Lazy[id];
  return;
}
void LzyUpdate(int id, int l, int r, int st, int ed, long long int v) {
  if (l >= st && r <= ed) {
    Lazy[id] += v;
    if (Tree[id].first >= 1000000000000000000LL) {
    } else {
      Tree[id].first += v;
    }
    return;
  }
  int mid = (l + r) / 2;
  int lft = 2 * id;
  int rgt = lft + 1;
  if (ed <= mid)
    LzyUpdate(lft, l, mid, st, ed, v);
  else if (st > mid)
    LzyUpdate(rgt, mid + 1, r, st, ed, v);
  else {
    LzyUpdate(lft, l, mid, st, ed, v);
    LzyUpdate(rgt, mid + 1, r, st, ed, v);
  }
  Tree[id] = Chk(Tree[lft], Tree[rgt]);
  if (Tree[id].first < 1000000000000000000LL) Tree[id].first += Lazy[id];
}
pair<long long int, long long int> Qry(int id, int l, int r, int st, int ed,
                                       long long int v) {
  if (l >= st && r <= ed) {
    pair<long long int, long long int> nw = Tree[id];
    if (nw.first >= 1000000000000000000LL) return nw;
    nw.first += v;
    return nw;
  }
  int mid = (l + r) / 2;
  int lft = 2 * id;
  int rgt = lft + 1;
  long long int nv = v + Lazy[id];
  if (ed <= mid)
    return Qry(lft, l, mid, st, ed, nv);
  else if (st > mid)
    return Qry(rgt, mid + 1, r, st, ed, nv);
  else {
    pair<long long int, long long int> a = Qry(lft, l, mid, st, ed, nv);
    pair<long long int, long long int> b = Qry(rgt, mid + 1, r, st, ed, nv);
    return Chk(a, b);
  }
}
pair<long long int, long long int> ClimpChainFromU(int u, int v) {
  pair<long long int, long long int> ans =
      make_pair(1000000000000000000LL + 1, N + 1);
  while (true) {
    int uchain = IdNo[u], vchain = IdNo[v];
    int st = St[uchain];
    if (uchain == vchain) {
      int stt = Pos[v], ed = Pos[u];
      if (stt <= ed) {
        ans = Chk(ans, Qry(1, 1, N, stt, ed, 0));
      }
      return ans;
    }
    int stt = Pos[st], ed = Pos[u];
    ans = Chk(ans, Qry(1, 1, N, stt, ed, 0));
    u = Par[st];
  }
}
int main() {
  int n, m, q;
  n = in<int>(), m = in<int>(), q = in<int>();
  for (int i = 1; i < n; i++) {
    int x, y;
    x = in<int>(), y = in<int>();
    A[x].push_back(y);
    A[y].push_back(x);
  }
  for (int i = 1; i < n + 1; i++) B[i].push_back(1000000000000000000LL);
  for (int i = 1; i < m + 1; i++) {
    int x;
    x = in<int>();
    B[x].push_back(i);
  }
  for (int i = 1; i < n + 1; i++)
    sort(B[i].begin(), B[i].end(), greater<long long int>());
  ChainNo = 1;
  for (int i = 1; i <= n; i++) {
    St[i] = -1;
  }
  Dfs(1, 0, 1);
  Hld(1, 0);
  N = now;
  Build(1, 1, N);
  while (q--) {
    int tp;
    tp = in<int>();
    if (tp == 1) {
      int u, v, k;
      u = in<int>(), v = in<int>(), k = in<int>();
      vector<int> ans;
      int lc = Lca(u, v);
      for (int i = 0; i < k; i++) {
        pair<long long int, long long int> tp =
            Chk(ClimpChainFromU(u, lc), ClimpChainFromU(v, lc));
        if (tp.first >= 1000000000000000000LL) break;
        int lst = Save[Wd[tp.second]].size() - 1;
        ans.push_back(Save[Wd[tp.second]][lst]);
        PointUpdate(1, 1, N, W[tp.second]);
      }
      printf("%d", ans.size());
      for (int i = 0; i < ans.size(); i++) {
        printf(" %d", ans[i]);
      }
      printf("\n");
    } else {
      long long int v, k;
      v = in<long long int>(), k = in<long long int>();
      LzyUpdate(1, 1, N, Pos[v], Ed[v], k);
    }
  }
  return 0;
}
