Convert Input to Direction Challenge

Given input in the form &lt;n1&gt;, &lt;n2&gt; where number can be -1, 0, or 1, return the corresponding cardinal direction. Positive numbers move East in the x-axis and South in the y-axis, Negative numbers move West in the x-axis and North in the y-axis.

Output must be in the form South East, North East, North. It is case-sensitive.

If the input is 0, 0, your program must return That goes nowhere, silly!.

Sample Input/Outpot:

1, 1 -> South East

0, 1 -> South

1, -1 -> North East

0, 0 -> That goes nowhere, silly!

This is code-golf, the shortest answer in bytes wins.
Japt, 55 51 bytes

`
SÆ&#8; 
NÆ° `·gV +`
E&#134;t
W&#131;t`·gU ª`T&#149;t go&#131; Í2&#128;e, Ðéy!


Explanation

                      // Implicit: U, V = inputs
`\nSÆ&#8; \nNÆ° `       // Take the string "\nSouth \nNorth ".
·                     // Split it at newlines, giving ["", "South ", "North "].
gV                    // Get the item at index V. -1 corresponds to the last item.
+                     // Concatenate this with
`\nE&#134;t\nW&#131;t`·gU       // the item at index U in ["", "East", "West"].
ª`T&#149;t go&#131; Í2&#128;e, Ðéy!  // If the result is empty, instead take "That goes nowhere, silly!".
                      // Implicit: output result of last expression


Try it online!