Given an array of valid words and a string representing a scrambled note, find the first word from the array that can be completely formed using the characters available in the note. Each letter in the note can only be used once, and the matching should be case-insensitive and independent of order. If no word from the list can be formed, return a hyphen string ("-").