3
1 1 5
1 3 42
1 2 42
 2
42 23
1 2 10
 10
45792697 27183921 4791060 77070594 27286110 66957065 19283638 2944837 26775511 65379701
5 8 25
8 10 94
1 4 14
9 7 96
4 2 16
2 6 58
2 3 99
6 8 21
8 9 87
 5
3 1 2 6 5
1 2 3
2 3 1
4 3 9
5 3 1
 10
26 31 21 57 56 44 54 58 79 97
2 1 277
1 8 91
1 7 380
4 1 649
10 5 799
10 1 940
8 6 627
6 3 177
9 6 685
 10
8 100 62 38 26 51 26 23 77 32
6 8 29
4 1 82
7 8 66
7 10 67
8 9 98
6 1 14
1 5 48
3 1 58
2 9 90
 2
23 42
1 2 10
 1
42
 3
1 5 1
1 3 42
1 2 42
 10
1 1 1 1 1 1 1 1 1 1
1 2 5
1 3 5
1 4 5
1 5 5
1 6 5
1 7 5
1 8 5
1 9 5
1 10 5
 3
1 1 1
1 2 42
2 3 42
 3
5 1 1
1 3 42
1 2 24

3 1042.0638260857 1 727.3238618387 6 283959805416.40496826
 3 192.0000000000 1 13952642.4776933547 8 544327.1927847408 2 727.3238618387 1 0.0000000000 2 1042.0638260857 1 100.6230589875 2 544.3822186663 1 389.7666169867
#include <bits/stdc++.h>
using namespace std;
struct edge {
  int v, nxt, w;
} e[400050];
int deg[200050], head[200050], ecnt, n;
void adde(int u, int v, int w) {
  deg[u]++;
  e[++ecnt].v = v;
  e[ecnt].nxt = head[u];
  e[ecnt].w = w;
  head[u] = ecnt;
}
int mxsz[200050], sz[200050], sum, rt;
bool vis[200050];
void getsize(int pos, int lst) {
  mxsz[pos] = 0;
  sz[pos] = 1;
  for (int i = head[pos]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (v != lst && !vis[v])
      getsize(v, pos), sz[pos] += sz[v], mxsz[pos] = max(mxsz[pos], sz[v]);
  }
  mxsz[pos] = max(mxsz[pos], sum - sz[pos]);
  if (mxsz[pos] < mxsz[rt]) rt = pos;
}
int p;
int w[200050];
double ovall;
double getans(int pos, int lst, int dist, int flg = 0) {
  double cur = w[pos] * pow(dist, 1.5);
  for (int i = head[pos]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (flg && vis[v]) continue;
    if (v != lst) cur += getans(v, pos, dist + e[i].w, flg);
  }
  return cur;
}
int cnt = 0;
void devide(int root) {
  double as = 0, as3 = 0;
  int po = 0, po2 = 0;
  vis[root] = 1;
  for (int i = head[root]; i; i = e[i].nxt) {
    int v = e[i].v;
    if (vis[v]) continue;
    if (sz[v] > sz[root]) sz[v] = sum - sz[root];
    double as2 = getans(v, root, e[i].w, 1);
    if (as2 > as)
      as3 = as, po2 = po, as = as2, po = v;
    else if (as2 > as3)
      as3 = as2, po2 = v;
  }
  as = getans(root, 0, 0);
  if (as < ovall) ovall = as, p = root;
  if (!po) return;
  as = 1e100, as3 = 1e100;
  if (po) as = getans(po, 0, 0);
  if (po2) as3 = getans(po2, 0, 0);
  if (as > as3) swap(po, po2);
  sum = sz[po];
  rt = 0;
  getsize(po, root);
  devide(rt);
}
int main() {
  ovall = 1e100;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &w[i]);
  for (int i = 1; i < n; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    adde(u, v, w), adde(v, u, w);
  }
  sum = n;
  mxsz[rt = 0] = 0x3f3f3f3f;
  getsize(1, 0);
  devide(rt);
  printf("%d %.10lf\n", p, ovall);
}
