I did not write `tray.svg`, because the six requests cannot all be satisfied — there is no valid one-to-one assignment. Here is the proof.

**Relevant drink properties**
- Dairy: Vanilla cortado, Decaf cortado (exactly 2)
- Decaf: Decaf cortado, Decaf oat vanilla latte (exactly 2)
- Vanilla: Vanilla cortado, Decaf oat vanilla latte (exactly 2)
- Cold: Iced oat latte, Cold brew
- Black: Cold brew, Filter coffee

**The contradiction**
- Tables 1 and 4 both require dairy milk, and only two drinks contain dairy: the Vanilla cortado and the Decaf cortado. So those two drinks are fully consumed by Tables 1 and 4.
- Table 2 requires decaf. The only decaf drinks are the Decaf cortado (already used above) and the Decaf oat vanilla latte. So Table 2 must get the Decaf oat vanilla latte.
- Table 3 requires vanilla. The only vanilla drinks are the Vanilla cortado (used by Table 1/4) and the Decaf oat vanilla latte (used by Table 2). Nothing vanilla is left.

Equivalently, in matching terms: Tables {1,2,3,4} collectively accept only drinks from {Vanilla cortado, Decaf cortado, Decaf oat vanilla latte} — three drinks for four tables. Hall's condition fails, so no perfect matching exists. I also brute-forced all 720 permutations to confirm: **0 valid assignments**.

I considered relaxing Table 1's wording to "no non-dairy milk" (i.e. black coffee allowed), but that produces four different valid assignments, so there is still no unique intended tray.

Because any cup-by-cup label I rendered would necessarily violate at least one table's stated request, I deliberately left `tray.svg` unwritten rather than draw a plausible-looking but incorrect tray. If the intent was that Table 1 merely wants no *plant* milk, tell me and I'll render one of the four valid layouts instead.